Sciweavers

421 search results - page 23 / 85
» Ant algorithms
Sort
View
ANTS
2004
Springer
149views Algorithms» more  ANTS 2004»
14 years 24 days ago
A Binary Recursive Gcd Algorithm
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
Damien Stehlé, Paul Zimmermann
EOR
2008
140views more  EOR 2008»
13 years 7 months ago
Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
Christine Solnon
PPSN
1998
Springer
13 years 11 months ago
Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks
In this paper we present AntNet, a novel adaptive approach to routing tables learning in packet-switched communications networks. AntNet is inspired by the stigmergy model of commu...
Gianni Di Caro, Marco Dorigo
ANTS
2000
Springer
92views Algorithms» more  ANTS 2000»
13 years 11 months ago
Computing Special Values of Partial Zeta Functions
We discuss computation of the special values of partial zeta functions associated to totally real number fields. The main tool is the Eisenstein cocycle Ψ, a group cocycle for GL...
Gautam Chinta, Paul E. Gunnells, Robert Sczech
ANTS
2006
Springer
95views Algorithms» more  ANTS 2006»
13 years 11 months ago
Computing Pro-P Galois Groups
We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois grou...
Nigel Boston, Harris Nover