Sciweavers

Share
GECCO
2007
Springer

Hierarchical genetic programming based on test input subsets

9 years 5 months ago
Hierarchical genetic programming based on test input subsets
Crucial to the more widespread use of evolutionary computation techniques is the ability to scale up to handle complex problems. In the field of genetic programming, a number of decomposition and reuse techniques have been devised to address this. As an alternative to the more commonly employed encapsulation methods, we propose an approach based on the division of test input cases into subsets, each dealt with by an independently evolved code segment. Two program architectures are suggested for this hierarchical approach, and experimentation demonstrates that they offer substantial performance improvements over more established methods. Difficult problems such as even-10 parity are readily solved with small population sizes. Categories and Subject Descriptors
David Jackson
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where GECCO
Authors David Jackson
Comments (0)
books