Cartesian Genetic Programming
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...
Corporate Author: | SpringerLink (Online service) |
---|---|
Other Authors: | Miller, Julian F. (Editor) |
Format: | Electronic eBook |
Language: | English |
Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2011.
|
Series: | Natural Computing Series,
|
Subjects: | |
Online Access: | Full Text via HEAL-Link |
Similar Items
-
The Art of Artificial Evolution A Handbook on Evolutionary Art and Music /
Published: (2008) -
Evolutionary Optimization: the µGP toolkit
by: Sanchez, Ernesto, et al.
Published: (2011) -
Genome Clustering From Linguistic Models to Classification of Genetic Texts /
by: Bolshoy, Alexander, et al.
Published: (2010) -
Rough – Granular Computing in Knowledge Discovery and Data Mining
by: Stepaniuk, Jarosław
Published: (2008) -
Soft Computing for Hybrid Intelligent Systems
Published: (2008)