3569 search results - page 152 / 714 » On the Evolution of Evolutionary Algorithms |
144
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
120
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
We present a multi-objective evolutionary algorithm approach to the map-labelling problem. Map-labelling involves placing labels for sites onto a map such that the result is easy ...
155
Voted
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
130
click to vote
ICANNGA
2007
Springer
15 years 6 months ago
2007
Springer
Significant improvement over a patented lens design is achieved using multi-objective evolutionary optimization. A comparison of the results obtained from NSGA2 and ε-MOEA is done...
128
Voted
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
There are several studies on the desirable properties that a performance measure for evolutionary multiobjective algorithms must have. One of these properties is called “compati...