48 search results - page 8 / 10 » Runtime Analysis of a Simple Ant Colony Optimization Algorit... |
GECCO
2007
Springer
14 years 23 days ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
CC
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Alias analysis, traditionally performed statically, is unsuited for a dynamic binary translator (DBT) due to incomplete control-flow information and the high complexity o...
GECCO
2007
Springer
14 years 23 days ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
GECCO
2005
Springer
14 years 3 days ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...