421 search results - page 40 / 85 » Ant algorithms |
89
Voted
ANTS
2008
Springer
15 years 4 months ago
2008
Springer
We present an algorithm that, on input of a CM-field K, an integer k 1, and a prime r 1 mod k, constructs a q-Weil number OK corresponding to an ordinary, simple abelian variety ...
135
Voted
AEI
2004
15 years 2 months ago
2004
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
123
click to vote
IJIS
2007
15 years 2 months ago
2007
Algorithms for clustering web search results have to be efficient and robust. Furthermore they must be able to cluster a dataset without using any kind of a priori information, s...
108
Voted
ANTS
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We further analyze the solutions to the Diophantine equations from which prime-order elliptic curves of embedding degrees k = 3, 4 or 6 (MNT curves) may be obtained. We g...
137
click to vote
GPEM
2002
15 years 2 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...