SMCGP2: self modifying cartesian genetic programming in two dimensions

Authors:
Simon Harding;Julian F. Miller;Wolfgang Banzhaf
Affiliations:
Memorial University, St John's, Canada;University of York, York, United Kingdom;Memorial University, St John's, Canada
Venue:
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Year:
2011

Citing 13
Cited 5

Evolving recursive functions for the even-parity problem using genetic programming

Advances in genetic programming
Solving High-Order Boolean Parity Problems with Smooth Uniform Crossover, Sub-Machine Code GP and Demes

Genetic Programming and Evolvable Machines
Cartesian Genetic Programming

Proceedings of the European Conference on Genetic Programming
Development Brings Scalability to Hardware Evolution

EH '05 Proceedings of the 2005 NASA/DoD Conference on Evolvable Hardware
Evolving Recursive Programs by Using Adaptive Grammar Based Genetic Programming

Genetic Programming and Evolvable Machines
Self-modifying cartesian genetic programming

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Developmental Evaluation in Genetic Programming: A Position Paper

FBIT '07 Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies
Self modifying cartesian genetic programming: parity

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A developmental method for growing graphs and circuits

ICES'03 Proceedings of the 5th international conference on Evolvable systems: from biology to hardware
Developments in Cartesian Genetic Programming: self-modifying CGP

Genetic Programming and Evolvable Machines
SMCGP2: finding algorithms that approximate numerical constants using quaternions and complex numbers

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Redundancy and computational efficiency in Cartesian genetic programming

IEEE Transactions on Evolutionary Computation
The Automatic Acquisition, Evolution and Reuse of Modules in Cartesian Genetic Programming

IEEE Transactions on Evolutionary Computation

SMCGP2: finding algorithms that approximate numerical constants using quaternions and complex numbers

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Implementing cartesian genetic programming classifiers on graphics processing units using GPU.NET

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Differential gene expression with tree-adjunct grammars

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
On the evolvability of a hybrid ant colony-cartesian genetic programming methodology

EuroGP'13 Proceedings of the 16th European conference on Genetic Programming
GECCO 2013 tutorial: cartesian genetic programming

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Self Modifying Cartesian Genetic Programming is a general purpose, graph-based, developmental form of Cartesian Genetic Programming. Using a combination of computational functions and special functions that can modify the phenotype at runtime, it has been employed to find general solutions to certain Boolean circuits and mathematical problems. In the present work, a new version, of SMCGP is proposed and demonstrated. Compared to the original SMCGP both the representation and the function set have been simplified. However, the new representation is also two-dimensional and it allows evolution and development to have more ways to solve a given problem. Under most situations we show that the new method makes the evolution of solutions to even parity and binary addition faster than with previous version of SMCGP.