Sciweavers

473 search results - page 11 / 95
» Computing shortest paths with uncertainty
Sort
View
GECCO
2008
Springer
110views Optimization» more  GECCO 2008»
15 years 23 days ago
Crossover can provably be useful in evolutionary computation
We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoret...
Benjamin Doerr, Edda Happ, Christian Klein