Created by W.Langdon from gp-bibliography.bib Revision:1.6164
Since then, the classical form of CGP has been developed made more efficient in various ways. Notably, by including automatically defined functions (modular CGP) and self-modification operators (self-modifying CGP). SMCGP was developed by Julian Miller, Simon Harding and Wolfgang Banzhaf. It uses functions that cause the evolved programs to change themselves as a function of time. Using this technique it is possible to find general solutions to classes of problems and mathematical algorithms (e.g. arbitrary parity, n-bit binary addition, sequences that provably compute pi and e to arbitrary precision, and so on).
The tutorial will cover the basic technique, advanced developments and applications to a variety of problem domains.",
ACM Order Number 910122.",
Genetic Programming entries for Julian F Miller Simon Harding