Sciweavers

224 search results - page 35 / 45
» Quick-and-dirty ant colony optimization
Sort
View
ADHOC
2010
317views more  ADHOC 2010»
13 years 4 months ago
Simple ant routing algorithm strategies for a (Multipurpose) MANET model
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
Fernando Correia, Teresa Vazão
GECCO
2006
Springer
210views Optimization» more  GECCO 2006»
13 years 11 months ago
Adaptive diversity in PSO
Spatial Extension PSO (SEPSO) and Attractive-Repulsive PSO (ARPSO) are methods for artificial injection of diversity into particle swarm optimizers that are intended to encourage ...
Christopher K. Monson, Kevin D. Seppi
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 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...
GECCO
2003
Springer
130views Optimization» more  GECCO 2003»
14 years 23 days ago
Extracting Test Sequences from a Markov Software Usage Model by ACO
The aim of the paper is to investigate methods for deriving a suitable set of test paths for a software system. The design and the possible uses of the software system are modelled...
Karl Doerner, Walter J. Gutjahr
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
14 years 1 months ago
Analyzing heuristic performance with response surface models: prediction, optimization and robustness
This research uses a Design of Experiments (DOE) approach to build a predictive model of the performance of a combinatorial optimization heuristic over a range of heuristic tuning...
Enda Ridge, Daniel Kudenko