Results 51 to 60 of about 11,417,388 (340)
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 +4 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 +6 more sources
EntropyNumerical computation of the rate–distortion (RD) function is a key problem in RD theory. Thus far, efficient algorithms have been well studied for discrete sources, but for continuous sources, there is still lack of a rigorously developed solution.
Lingyi Chen +5 more
doaj +1 more source
Improvement of Corner Detection Algorithms (Harris, FAST and SUSAN) Based on Reduction of Features Space and Complexity Time [PDF]
Engineering and Technology Journal, 2017 The active detection for gratifying features can be a definitive pace for computer vision in different tasks. Corners become more preferable models because of their two dimensional constrain; two dimensional limitations and algorithms can be rapid to ...
A.A. Karim, E. F. Nasser
doaj +1 more source
Generalization of Liu–Zhou Method for Multiple Roots of Applied Science Problems
MathematicsSome optimal and non-optimal iterative approaches for computing multiple zeros of nonlinear functions have recently been published in the literature when the multiplicity θ of the root is known.
Sunil Kumar +5 more
doaj +1 more source
A Fast Algorithm for Calculation of Thêo1 [PDF]
IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control, 2020 Thêo1 is a frequency stability statistic which is similar to the Allan variance but can provide stability estimates at longer averaging factors and with higher confidence. However, the calculation of Thêo1 is significantly slower than the Allan variance, particularly for large data sets, due to a worse computational complexity.
openaire +5 more sources
Generating Fast Indulgent Algorithms [PDF]
Theory of Computing Systems, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dan Alistarh +3 more
openaire +6 more sources
Fast index based algorithms and software for matching position specific scoring matrices [PDF]
, 2006 Beckstette M, Homann R, Giegerich R, Kurtz S. Fast index based algorithms and software for matching position specific scoring matrices. BMC Bioinformatics.
Kurtz Stefan +11 more
core +1 more source
Fast Algorithms for Basic Supply Chain Scheduling Problems
Mathematics, 2020 A basic supply chain scheduling problem in which the orders released over time are to be delivered into the batches with unlimited capacity is considered.
Nodari Vakhania, Badri Mamporia
doaj +1 more source
Fast Perturbative Algorithm Configurators [PDF]
, 2020 Recent work has shown that the ParamRLS and ParamILS algorithm configurators can tune some simple randomised search heuristics for standard benchmark functions in linear expected time in the size of the parameter space. In this paper we prove a linear lower bound on the expected time to optimise any parameter tuning problem for ParamRLS, ParamILS as ...
Hall, G.T., Oliveto, P.S., Sudholt, D.
openaire +5 more sources