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
Hierarchical learning with procedural abstraction mechanisms
Hierarchical learning with procedural abstraction mechanisms
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Boolean Functions Fitness Spaces
Proceedings of the Second European Workshop on Genetic Programming
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Schema theory for genetic programming with one-point crossover and point mutation
Evolutionary Computation
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Tree Based Differential Evolution
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
On Crossover Success Rate in Genetic Programming with Offspring Selection
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Evolving CUDA PTX programs by quantum inspired linear genetic programming
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Operator equalisation for bloat free genetic programming and a survey of bloat control methods
Genetic Programming and Evolvable Machines
| Hi-index | 0.00 |
In this paper we examine the behaviour of the uniform crossover and point mutation GP operators [12] on the even-n-parity problem for n = 3,4,6 and present a novel representation of function nodes, designed to allow the search operators to make smaller movements around the solution space. Using this representation, performance on the even-6-parity problem is improved by three orders of magnitude relative to the estimate given for standard GP in [5].