Sciweavers

7 search results - page 1 / 2
» Self modifying Cartesian Genetic Programming: Parity
Sort
View
CEC
2009
IEEE
14 years 5 months ago
Self modifying Cartesian Genetic Programming: Parity
— Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It differs from CGP by including primitive functions which modify the program. Beginni...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
EUROGP
2009
Springer
138views Optimization» more  EUROGP 2009»
14 years 5 months ago
Self Modifying Cartesian Genetic Programming: Fibonacci, Squares, Regression and Summing
Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It is able to modify its own phenotype during execution of the evolved program. This is do...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
14 years 3 months ago
Evolution, development and learning using self-modifying cartesian genetic programming
Self-Modifying Cartesian Genetic Programming (SMCGP) is a form of genetic programming that integrates developmental (self-modifying) features as a genotype-phenotype mapping. This...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
GPEM
2010
180views more  GPEM 2010»
13 years 9 months ago
Developments in Cartesian Genetic Programming: self-modifying CGP
Abstract Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming....
Simon Harding, Julian F. Miller, Wolfgang Banzhaf
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 4 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins