Sciweavers

138 search results - page 17 / 28
» Canonical representation genetic programming
Sort
View
GPEM
2008
128views more  GPEM 2008»
13 years 10 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 3 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
14 years 1 months ago
Aspects of adaptation in natural and artificial evolution
This work addresses selected aspects of natural evolution, especially of the field of population genetics, that are considered to be meaningful for algorithmic further development...
Michael Affenzeller, Stefan Wagner 0002, Stephan M...
GECCO
2003
Springer
14 years 3 months ago
Methods for Evolving Robust Programs
Many evolutionary computation search spaces require fitness assessment through the sampling of and generalization over a large set of possible cases as input. Such spaces seem par...
Liviu Panait, Sean Luke
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 4 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming 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. ...
Cezary Z. Janikow