Sciweavers

5595 search results - page 831 / 1119
» Comparing Subsumption Optimizations
Sort
View
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
16 years 1 months ago
An extended mutation concept for the local selection based differential evolution algorithm
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...
Jani Rönkkönen, Jouni Lampinen
194
Voted
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
16 years 1 months ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
16 years 1 months ago
On the constructiveness of context-aware crossover
Crossover in Genetic Programming is mostly a destructive operator, generally producing children worse than the parents and occasionally producing those who are better. A recently ...
Hammad Majeed, Conor Ryan
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
16 years 1 months ago
Genetic programming for cross-task knowledge sharing
We consider multitask learning of visual concepts within genetic programming (GP) framework. The proposed method evolves a population of GP individuals, with each of them composed...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
16 years 1 months ago
Acquiring evolvability through adaptive representations
Adaptive representations allow evolution to explore the space of phenotypes by choosing the most suitable set of genotypic parameters. Although such an approach is believed to be ...
Joseph Reisinger, Risto Miikkulainen