22018 search results - page 4170 / 4404 » or 2004 |
196
click to vote
GD
2004
Springer
16 years 11 hour ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
144
click to vote
GECCO
2004
Springer
16 years 11 hour ago
2004
Springer
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
166
click to vote
GECCO
2004
Springer
16 years 11 hour ago
2004
Springer
Using a directed mutation can improve the efficiency of processing many optimization problems. The first mutation operators of this kind proposed by Hildebrand [1], however, suffer...
139
click to vote
GECCO
2004
Springer
16 years 11 hour ago
2004
Springer
This paper describes POPE-GP, a system that makes use of the NSGA-II multiobjective evolutionary algorithm as an alternative, parameter-free technique for eliminating program bloat...
184
click to vote
GECCO
2004
Springer
16 years 11 hour ago
2004
Springer
Abstract. This paper is concerned with a dynamic vehicle routing problem. The problem is dynamic in the sense that the time it will take to traverse each edge is uncertain. The pro...