TY - BOOK AU - ED - SpringerLink (Online service) TI - Cartesian Genetic Programming T2 - Natural Computing Series, SN - 9783642173103 AV - QA75.5-76.95 U1 - 004.0151 23 PY - 2011/// CY - Berlin, Heidelberg PB - Springer Berlin Heidelberg KW - Computer science KW - Information theory KW - Artificial intelligence KW - Information systems KW - Computer aided design KW - Computer engineering KW - Computer Science KW - Theory of Computation KW - Electrical Engineering KW - Artificial Intelligence (incl. Robotics) KW - Computer-Aided Engineering (CAD, CAE) and Design KW - Computer Appl. in Arts and Humanities N1 - 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; ZDB-2-SCS N2 - 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 genotypephenotype 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 UR - http://dx.doi.org/10.1007/978-3-642-17310-3 ER -