Sciweavers

16 search results - page 3 / 4
» Evolutionary Methods for Ant Colony Paintings
Sort
View
TEC
2008
98views more  TEC 2008»
13 years 5 months ago
Opposition-Based Differential Evolution
Evolutionary Algorithms (EAs) are well-known optimization approaches to cope with non-linear, complex problems. These population-based algorithms, however, suffer from a general we...
Shahryar Rahnamayan, Hamid R. Tizhoosh, Magdy M. A...
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
13 years 12 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
13 years 12 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
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
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 9 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....