A connectionist machine for genetic hillclimbing
A connectionist machine for genetic hillclimbing
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
LINKGAUGE: Tackling Hard Deceptive Problems With A New Linkage Learning Genetic Algorithm
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Proceedings of the European Conference on Genetic Programming
Genetic Algorithms Using Grammatical Evolution
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Investigating the performance of module acquisition in cartesian genetic programming
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Embedded cartesian genetic programming and the lawnmower and hierarchical-if-and-only-if problems
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Adapting operator settings in genetic algorithms
Evolutionary Computation
mGGA: the meta-grammar genetic algorithm
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Solving real-valued optimisation problems using cartesian genetic programming
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
GECCO 2011 tutorial: cartesian genetic programming
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
GECCO 2012 tutorial: cartesian genetic programming
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
GECCO 2013 tutorial: cartesian genetic programming
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Function optimization using cartesian genetic programming
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) capable of acquiring, evolving and re-using partial solutions. In this paper, we apply for the first time CGP and ECGP to the ones-max and order-3 deceptive problems, which are normally associated with Genetic Algorithms. Our approach uses CGP and ECGP to evolve a sequence of commands for a tape-head, which produces an arbitrary length binary string on a piece of tape. Computational effort figures are calculated for CGP and ECGP and our results compare favourably with those of Genetic Algorithms.