Cargando…

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:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-642-17310-3
003 DE-He213
005 20230719193659.0
007 cr nn 008mamaa
008 110915s2011 gw | s |||| 0|eng d
020 |a 9783642173103  |9 978-3-642-17310-3 
024 7 |a 10.1007/978-3-642-17310-3  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Cartesian Genetic Programming  |h [electronic resource] /  |c edited by Julian F. Miller. 
250 |a 1st ed. 2011. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2011. 
300 |a XXII, 346 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Natural Computing Series,  |x 2627-6461 
505 0 |a Introduction -- Cartesian Genetic Programming -- Modular Cartesian Genetic Programming -- Self-modifying Cartesian Genetic Programming -- Evolution of Electronic Circuits -- Image Processing -- Developmental Approaches -- Artificial Neural Approaches -- Medical Applications -- Hardware Acceleration -- Control Applications -- Evolutionary Art -- Future Directions -- App. A, A Bibliography of CGP Papers -- App. B, CGP Software. 
520 |a 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.  . 
650 0 |a Computer science. 
650 0 |a Electrical engineering. 
650 0 |a Artificial intelligence. 
650 0 |a Computer-aided engineering. 
650 0 |a Digital humanities. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Electrical and Electronic Engineering. 
650 2 4 |a Artificial Intelligence. 
650 2 4 |a Computer-Aided Engineering (CAD, CAE) and Design. 
650 2 4 |a Digital Humanities. 
700 1 |a Miller, Julian F.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642269981 
776 0 8 |i Printed edition:  |z 9783642173097 
776 0 8 |i Printed edition:  |z 9783642173110 
830 0 |a Natural Computing Series,  |x 2627-6461 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-642-17310-3  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)