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
Random Tree Generation for Genetic Programming
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
An Analysis of Koza's Computational Effort Statistic for Genetic Programming
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Fitness Causes Bloat: Mutation
EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
Towards scalable genetic programming
Towards scalable genetic programming
HS-Model: a hierarchical statistical subtree-generating model for genetic programming
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
A survey and taxonomy of performance improvement of canonical genetic programming
Knowledge and Information Systems
Efficiently evolving programs through the search for novelty
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Automated problem decomposition for the boolean domain with genetic programming
EuroGP'13 Proceedings of the 16th European conference on Genetic Programming
MuACOsm: a new mutation-based ant colony optimization algorithm for learning finite-state machines
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subroutines for genetic programming. This algorithm is tested on the Artificial Ant on the Santa Fe Trail problem, a venerable problem for genetic programming systems. When four levels of iteration are used, the algorithm presented here generates better results than any known published result by a factor of 7.