436 search results - page 42 / 88 » Ant algorithms and stigmergy |
175
click to vote
ANTS
1998
Springer
15 years 10 months ago
1998
Springer
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the on...
125
click to vote
ANTS
2006
Springer
15 years 9 months ago
2006
Springer
We propose a practical sampling reduction algorithm for lattice bases based on work by Schnorr [1] as well as two even more effective generalizations. We report the empirical behav...
176
click to vote
ANTS
2006
Springer
15 years 9 months ago
2006
Springer
Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the...
156
click to vote
ANTSW
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
163
click to vote
PREMI
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most prom...