Sciweavers

4 search results - page 1 / 1
» A short convergence proof for a class of ant colony optimiza...
Sort
View
TEC
2002
103views more  TEC 2002»
13 years 4 months ago
A short convergence proof for a class of ant colony optimization algorithms
In this paper, we prove some convergence properties for a class of ant colony optimization algorithms. In particular, we prove that for any small constant 0 and for a sufficiently ...
Thomas Stützle, Marco Dorigo
COR
2008
122views more  COR 2008»
13 years 5 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
ADHOC
2008
183views more  ADHOC 2008»
13 years 5 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
BMCBI
2006
161views more  BMCBI 2006»
13 years 5 months ago
A novel approach to phylogenetic tree construction using stochastic optimization and clustering
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
Ling Qin, Yixin Chen, Yi Pan, Ling Chen