Sciweavers

1253 search results - page 111 / 251
» Convergence of Evolutionary Algorithms in General Search Spa...
Sort
View
TEC
2002
117views more  TEC 2002»
15 years 6 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
15 years 11 months ago
Toward comparison-based adaptive operator selection
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
Álvaro Fialho, Marc Schoenauer, Michè...
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
16 years 17 days ago
A multi-objective approach to search-based test data generation
There has been a considerable body of work on search–based test data generation for branch coverage. However, hitherto, there has been no work on multi–objective branch covera...
Kiran Lakhotia, Mark Harman, Phil McMinn
ADHOCNOW
2003
Springer
15 years 11 months ago
Space-Time Routing in Ad Hoc Networks
We introduce Space-Time Routing (STR), a new approach to routing in mobile ad hoc networks. In STR, the age of routing state is considered jointly with the distance to the destinat...
Henri Dubois-Ferrière, Matthias Grossglause...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 17 days 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...