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
The evolution of evolvability in genetic programming
Advances in genetic programming
Discovery of subroutines in genetic programming
Advances in genetic programming
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Programming III: Darwinian Invention & Problem Solving
Genetic Programming III: Darwinian Invention & Problem Solving
Evolution of Vehicle Detectors for Infrared Line Scan Imagery
EvoIASP '99/EuroEcTel '99 Proceedings of the First European Workshops on Evolutionary Image Analysis, Signal Processing and Telecommunications
Genetic Programming and Evolvable Machines
The Push3 execution stack and the evolution of control
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Hierarchical genetic programming based on test input subsets
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Genetic programming for cross-task knowledge sharing
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Knowledge reuse in genetic programming applied to visual learning
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Evolving encapsulated programs as shared grammars
Genetic Programming and Evolvable Machines
Multi-task code reuse in genetic programming
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Accelerating genetic programming by frequent subtree mining
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Multitask visual learning using genetic programming
Evolutionary Computation
A survey and taxonomy of performance improvement of canonical genetic programming
Knowledge and Information Systems
Self-adaptive focusing of evolutionary effort in hierarchical genetic programming
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Layered learning in boolean GP problems
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Partitioned incremental evolution of hardware using genetic programming
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
The performance of a selection architecture for genetic programming
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Compressed linear genetic programming: empirical parameter study on the Even-n-parity problem
EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
Have your spaghetti and eat it too: evolutionary algorithmics and post-evolutionary analysis
Genetic Programming and Evolvable Machines
Tag-based modules in genetic programming
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Undirected training of run transferable libraries
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
On relationships between semantic diversity, complexity and modularity of programming tasks
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Tag-based modularity in tree-based genetic programming
Proceedings of the 14th 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
| Hi-index | 0.01 |
In tree-based genetic programming (GP), the most frequent subtrees on later generations are likely to constitute useful partial solutions. This paper investigates the effect of encapsulating such subtrees by representing them as atoms in the terminal set, so that the subtree evaluations can be exploited as terminal data. The encapsulation scheme is compared against a second scheme which depends on random subtree selection. Empirical results show that both schemes improve upon standard GP.