Sciweavers

2157 search results - page 3 / 432
» Binary ant algorithm
Sort
View
ANTS
2004
Springer
149views Algorithms» more  ANTS 2004»
13 years 10 months ago
A Binary Recursive Gcd Algorithm
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
Damien Stehlé, Paul Zimmermann
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
13 years 11 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
ANTS
2004
Springer
139views Algorithms» more  ANTS 2004»
13 years 10 months ago
Binary GCD Like Algorithms for Some Complex Quadratic Rings
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
Saurabh Agarwal, Gudmund Skovbjerg Frandsen
ANTS
1998
Springer
93views Algorithms» more  ANTS 1998»
13 years 9 months ago
Evaluation of Linear Relations between Vectors of a Lattice in Euclidean Space
We prove that to find a nontrivial integer linear relation between vectors of a lattice L IRn , whose euclidean length is at most M, one needs O n5+ (ln Mn/)1+ binary operations f...
Igor A. Semaev