Functional genetic programming and exhaustive program search with combinator expressions
International Journal of Knowledge-based and Intelligent Engineering Systems - Genetic Programming An Emerging Engineering Tool
Comparison of CGP and Age-Layered CGP Performance in Image Operator Evolution
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Fitness landscape analysis and image filter evolution using functional-level CGP
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Robustness, evolvability, and accessibility in linear genetic programming
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Genetic Programming and Evolvable Machines
Length bias and search limitations in cartesian genetic programming
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
This research presents an extended 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 sampling used by the CGP is significantly less effective at locating solutions than the solution density of the corresponding formula space would warrant. We present results indicating that the loss of performance is caused by the sampling bias of the CGP, due to the neutrality friendly representation. We implement a simple intron free random sampling algorithm which performs considerably better on the same problem and then explain how such performance is possible.