Cartesian Genetic Programming (CGP) is a highly effective and increasingly popular form of genetic programming. It represents programs in the form of directed graphs, and a particular characteristic is that it has a highly redundant genotype–phenotype mapping, in that genes can be noncoding. It has spawned a number of new forms, each improving on the efficiency, among them modular, or embedded, CGP, and self-modifying CGP. It has been applied to many problems in both computer science and applied sciences.
This book contains chapters written by the leading figures in the development and application of CGP, and it will be essential reading for researchers in genetic programming and for engineers and scientists solving applications using these techniques. It will also be useful for advanced undergraduates and postgraduates seeking to understand and utilize a highly efficient form of genetic programming.
Author(s): Julian F. Miller (eds.)
Series: Natural Computing Series
Publisher: Springer
Year: 2011
Language: English
Pages: 367
Tags: Theory of Computation; Electrical Engineering; Artificial Intelligence (incl. Robotics); Computer-Aided Engineering (CAD, CAE) and Design; Computer Appl. in Arts and Humanities
Front Matter....Pages I-XXII
Introduction to Evolutionary Computation and Genetic Programming....Pages 1-16
Cartesian Genetic Programming....Pages 17-34
Problem Decomposition in Cartesian Genetic Programming....Pages 35-99
Self-Modifying Cartesian Genetic Programming....Pages 101-124
Evolution of Electronic Circuits....Pages 125-179
Image Processing and CGP....Pages 181-215
CGP Acceleration Using Field-Programmable Gate Arrays....Pages 217-230
Hardware Acceleration for CGP: Graphics Processing Units....Pages 231-253
The CGP Developmental Network....Pages 255-291
CGP, Creativity and Art....Pages 293-307
Medical Applications of Cartesian Genetic Programming....Pages 309-336
Back Matter....Pages 337-344
