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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Miller, Julian F. (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
Edición:1st ed. 2011.
Colección:Natural Computing Series,
Temas:
Computer science.
Electrical engineering.
Artificial intelligence.
Computer-aided engineering.
Digital humanities.
Theory of Computation.
Electrical and Electronic Engineering.
Artificial Intelligence.
Computer-Aided Engineering (CAD, CAE) and Design.
Digital Humanities.
Acceso en línea:Texto Completo
Descripción
Sumario: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.  .
Descripción Física:XXII, 346 p. online resource.
ISBN:9783642173103
ISSN:2627-6461

Ejemplares similares