102291 search results - page 19688 / 20459 » Computing |
200
click to vote
GD
2005
Springer
16 years 18 days ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
166
click to vote
GECCO
2005
Springer
16 years 18 days ago
2005
Springer
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
196
click to vote
GECCO
2005
Springer
16 years 18 days ago
2005
Springer
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...
191
click to vote
GECCO
2005
Springer
16 years 18 days ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
179
click to vote
GECCO
2005
Springer
16 years 18 days ago
2005
Springer
In this paper, a novel variant of particle swarm optimization (PSO), named memetic particle swarm optimization algorithm (MeSwarm), is proposed for tackling the overshooting probl...