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...
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
---|---|
Άλλοι συγγραφείς: | Miller, Julian F. (Επιμελητής έκδοσης) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2011.
|
Σειρά: | Natural Computing Series,
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
The Art of Artificial Evolution A Handbook on Evolutionary Art and Music /
Έκδοση: (2008) -
Evolutionary Optimization: the µGP toolkit
ανά: Sanchez, Ernesto, κ.ά.
Έκδοση: (2011) -
Genome Clustering From Linguistic Models to Classification of Genetic Texts /
ανά: Bolshoy, Alexander, κ.ά.
Έκδοση: (2010) -
Rough – Granular Computing in Knowledge Discovery and Data Mining
ανά: Stepaniuk, Jarosław
Έκδοση: (2008) -
Soft Computing for Hybrid Intelligent Systems
Έκδοση: (2008)