Results 31 to 40 of about 321,039 (266)
Efficient Algorithm for Scattering by a Large Cluster of Moving Objects
IEEE Access, 2019 A highly efficient algorithm for analysis of electromagnetic scattering by a large cluster of independently moving objects is proposed in this paper. A double octree structure is introduced, which consists of a main octree stationary to the cluster as a ...
Hai-Li Zhang +4 more
doaj +1 more source
Improved Fast-HotStuff Blockchian Consensus Algorithm [PDF]
Jisuanji gongcheng, 2021 The consensus process of the Fast-HotStuff blockchain consensus algorithm consists of two rounds of voting. When the leader node fails after the first round of voting, the throughput will be greatly reduced.
LI Qinan, XUE Zhihao, ZHANG Xuejun
doaj +1 more source
, 1985 Subsumption algorithms are used in resolution oriented theorem proving to eliminate redundant clauses from the search space. In a recent paper, the authors have introduced a new subsumption algorithm DC (Division into Components) which is much more efficient than the standard algorithms. In the present paper two new results are stated.
Gottlob, G, Leitsch, A
openaire +2 more sources
A fast algorithm for matrix balancing [PDF]
IMA Journal of Numerical Analysis, 2012 As long as a square nonnegative matrix A contains sufficient nonzero elements, then the matrix can be balanced, that is we can find a diagonal scaling of A that is doubly stochastic. A number of algorithms have been proposed to achieve the balancing, the most well known of these being the Sinkhorn-Knopp algorithm. In this paper we derive new algorithms
Knight, Philip, Ruiz, Daniel
openaire +7 more sources
Fast commutative matrix algorithms
Journal of Symbolic Computation, 2023 We show that the product of an nx3 matrix and a 3x3 matrix over a commutative ring can be computed using 6n+3 multiplications. For two 3x3 matrices this gives us an algorithm using 21 multiplications. This is an improvement with respect to Makarov's algorithm using 22 multiplications[13]. We generalize our result for nx3 and 3x3 matrices and present an
openaire +2 more sources
Maximally fast coarsening algorithms [PDF]
Physical Review E, 2005 We present maximally-fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time-step $Δt=A t_s^{2/3}$. For non-conserved systems, only effectively finite timesteps are accessible for similar unconditionally stable algorithms.
Cheng, Mowei, Rutenberg, Andrew
openaire +3 more sources
Fast mutation in crossover-based algorithms [PDF]
Proceedings of the 2020 Genetic and Evolutionary Computation Conference, 2020 The heavy-tailed mutation operator proposed in Doerr, Le, Makhmara, and Nguyen (GECCO 2017), called \emph{fast mutation} to agree with the previously used language, so far was proven to be advantageous only in mutation-based algorithms. There, it can relieve the algorithm designer from finding the optimal mutation rate and nevertheless obtain a ...
Denis Antipov +2 more
openaire +4 more sources
Design of the Fast Algorithm for Discrete Orthogonal Transforms and Their Unified Architectures
Journal of Harbin University of Science and Technology, 2021 Discrete orthogonal transform ( DOT ) is widely used in digital image processing and video compression，and it is of great practical significance to study its fast algorithm and design of general architecture.
HUANG Hai +4 more
doaj +1 more source
A Fast Algorithm for Backbones [PDF]
International Journal of Modern Physics C, 1998 A matching algorithm for the identification of backbones in percolation problems is introduced. Using this procedure, percolation backbones are studied in two- to five-dimensional systems containing 1.7×107 sites, two orders of magnitude larger than was previously possible using burning algorithms.
openaire +2 more sources
A Fast Algorithm for the Discrete Element Method by Contact Force Prediction [Translated]†
KONA Powder and Particle Journal, 2014 The discrete element method (DEM) takes enormous calculation time because it requires a very small time step, one small enough to represent the large frequency in the contact dynamic model.
Chiharu Tokoro +2 more
doaj +1 more source