436 search results - page 62 / 88 » Ant algorithms and stigmergy |
129
click to vote
ANTS
2006
Springer
15 years 9 months ago
2006
Springer
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
274
click to vote
NABIC
2010
15 years 26 days ago
2010
Abstract--Ant Colony Optimization (ACO) is a problemsolving technique that was inspired by the related research on the behavior of real-world ant colony. In the domain of Network-o...
188
click to vote
ANTS
2010
Springer
15 years 9 months ago
2010
Springer
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
182
click to vote
ANTS
2010
Springer
15 years 10 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
142
click to vote
GIS
2008
ACM
15 years 6 months ago
2008
ACM
This paper introduces an ant-based colony system for the representation of a verbal route description. It is grounded on a natural metaphor that mimics the behavior of ant colonie...