Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
The evolution of size and shape
Advances in genetic programming
Analysis of single-node (building) blocks in genetic programming
Advances in genetic programming
Foundations of genetic programming
Foundations of genetic programming
Random Generation of Trees: Random Generators in Computer Science
Random Generation of Trees: Random Generators in Computer Science
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Genetic Programming and Evolvable Machines
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
Genetic Programming and Evolvable Machines
Code growth in genetic programming
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Visualizing tree structures in genetic programming
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
What makes a problem GP-hard? validating a hypothesis of structural causes
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
A new evolutionary approach to the degree-constrained minimumspanning tree problem
IEEE Transactions on Evolutionary Computation
Visualizing Tree Structures in Genetic Programming
Genetic Programming and Evolvable Machines
Discovering biological motifs with genetic programming
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Characterizing the dynamics of symmetry breaking in genetic programming
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A genetic programming approach to business process mining
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Tree-structure-aware GP operators for automatic gait generation of quadruped robot
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Semantic analysis of program initialisation in genetic programming
Genetic Programming and Evolvable Machines
A survey and taxonomy of performance improvement of canonical genetic programming
Knowledge and Information Systems
Representation and structural biases in CGP
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
What makes a problem GP-hard? validating a hypothesis of structural causes
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Structural difficulty in grammatical evolution versus genetic programming
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
This paper presents a hypothesis about an undiscovered class of mechanisms that exist in standard GP. Rather than being intentionally designed, these mechanisms would be an unintended consequence of using trees as information structures. A model is described that predicts outcomes in GP that would arise solely from such mechanisms. Comparisons with empirical results from GP lend support to the existence of these mechanisms.