Genetic Programming: Papers from the AAAI Fall Symposium
John R. Koza and Eric V. Siegel, Cochairs
Genetic programming (GP) extends the genetic algorithm to the domain of computer programs. In genetic programming, populations of programs are selectively bred to solve problems. Genetic programming can solve problems of system identification, classification, control, robotics, optimization, game-playing, and pattern recognition. Starting with a primordial ooze of hundreds or thousands of randomly created programs composed of functions and terminals appropriate to the problem, the population is progressively evolved over a series of generations by applying the operations of Darwinian selection and crossover (sexual recombination).
Topics of interest for this symposium include:
- The theoretical basis of genetic programming
- Applications of genetic programming
- Rigorousness of validation techniques
- Hierarchical decomposition, e.g. automatically defined functions
- Competitive coevolution
- Automatic parameter tuning
- Representation issues
- Genetic operators
- Establishing standard benchmark problems
- Parallelization techniques
- Innovative variations
The format of the symposium will encourage interaction and discussion, but will also include around 25 brief presentations. Please contact Eric Siegel (e-mail address below) for questions concerning this symposium.