97 search results - page 10 / 20 » ants 2008 |
ANTS
2008
Springer
13 years 9 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
EOR
2008
13 years 7 months ago
2008
In this paper we present an extension of ant colony optimization (ACO) to continuous domains. We show how ACO, which was initially developed to be a metaheuristic for combinatoria...
SLS
2009
Springer
14 years 2 months ago
2009
Springer
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
ESANN
2008
13 years 9 months ago
2008
Ant-based clustering is a nature-inspired technique whereas stochastic agents perform the task of clustering high-dimensional data. This paper analyzes the popular technique of Lum...
IPL
2008
13 years 7 months ago
2008
In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in co...