Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Parallel distributed genetic programming
New ideas in optimization
Proceedings of the European Conference on Genetic Programming
Neutrality and the Evolvability of Boolean Function Landscape
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
The Automatic Acquisition, Evolution and Reuse of Modules in Cartesian Genetic Programming
IEEE Transactions on Evolutionary Computation
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Combining cartesian genetic programming with an estimation of distribution algorithm
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Evolving Variability-Tolerant CMOS Designs
ICES '08 Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Parallel evolution using multi-chromosome cartesian genetic programming
Genetic Programming and Evolvable Machines
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Towards evolving industry-feasible intrinsic variability tolerant CMOS designs
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
A new, node-focused model for genetic programming
EuroGP'12 Proceedings of the 15th European conference on Genetic Programming
GECCO 2012 tutorial: cartesian genetic programming
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Single node genetic programming on problems with side effects
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
EvoBIO'13 Proceedings of the 11th European conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics
Accelerating convergence in cartesian genetic programming by using a new genetic operator
Proceedings of the 15th annual conference on Genetic and evolutionary computation
GECCO 2013 tutorial: cartesian genetic programming
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Dynamical genetic programming in xcsf
Evolutionary Computation
| Hi-index | 0.00 |
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped to create the offspring. Later Miller and Thomson introduced Cartesian Genetic Programming, which uses directed graphs as a representation to replace the tree structures originally introduced by Koza. Cartesian Genetic Programming has been shown to perform better than the traditional Genetic Programming; but it does not use crossover to create offspring, it is implemented using mutation only. In this paper a new crossover method in Genetic Programming is introduced. The new technique is based on an adaptation of the Cartesian Genetic Programming representation and is tested on two simple regression problems. It is shown that by implementing the new crossover technique, convergence is faster than that of using mutation only in the Cartesian Genetic Programming method.