Sciweavers

2157 search results - page 45 / 432
» Binary ant algorithm
Sort
View
ANTS
1994
Springer
105views Algorithms» more  ANTS 1994»
14 years 18 days ago
A fast variant of the Gaussian reduction algorithm
We propose a fast variant of the Gaussian algorithm for the reduction of two{ dimensional lattices for the l1; l2; and l1;norm. The algorithm runs in at most O(n M(B) logB) bit op...
Michael Kaib
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
14 years 12 days ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres
CEC
2007
IEEE
14 years 2 months ago
An ant-based algorithm for annular sorting
— We present an ant-based algorithm for spatially sorting objects into an annular structure. The model is minimal, as it requires only stochastic ant behaviour coupled with a phe...
Martyn Amos, Oliver Don
AUSAI
2004
Springer
14 years 1 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
ANTS
2010
Springer
250views Algorithms» more  ANTS 2010»
14 years 12 days ago
A Subexponential Algorithm for Evaluating Large Degree Isogenies
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
David Jao, Vladimir Soukharev