1484 search results - page 23 / 297 » Ants meeting algorithms |
IMCSIT
2010
13 years 5 months ago
2010
Ant Colony Optimization (ACO) is a stochastic search method that mimics the social behavior of real ants colonies, which manage to establish the shortest route to feeding sources a...
ANTS
2004
Springer
14 years 1 months ago
2004
Springer
We present an algorithm for the computation of the discrete logarithm in logarithmic -Class Groups. This is applied to the calculation to the -rank of the wild kernel WK2 of a numb...
ANTS
1998
Springer
13 years 12 months ago
1998
Springer
We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O(...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
ANTS
2000
Springer
14 years 2 days ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...