Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Foundations of genetic programming
Foundations of genetic programming
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Genetic Programming and Evolvable Machines
General Schema Theory for Genetic Programming with Subtree-Swapping Crossover
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Strongly typed genetic programming
Evolutionary Computation
Schema theory for genetic programming with one-point crossover and point mutation
Evolutionary Computation
General schema theory for genetic programming with subtree-swapping crossover: Part II
Evolutionary Computation
Genetic Programming and Evolvable Machines
A theoretical analysis of the HIFF problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Backward-chaining evolutionary algorithms
Artificial Intelligence
Understanding the biases of generalised recombination: part I
Evolutionary Computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Sub-tree Swapping Crossover, Allele Diffusion and GP Convergence
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
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
Using crossover based similarity measure to improve genetic programming generalization ability
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Semantic analysis of program initialisation in genetic programming
Genetic Programming and Evolvable Machines
Backward-chaining evolutionary algorithms
Artificial Intelligence
Genetic programming for anticancer therapeutic response prediction using the NCI-60 dataset
Computers and Operations Research
On the limiting distribution of program sizes in tree-based genetic programming
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Characterizing fault tolerance in genetic programming
Future Generation Computer Systems
Semantic building blocks in genetic programming
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
New crossover operators in linear genetic programming for multiclass object classification
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Theoretical results in genetic programming: the next ten years?
Genetic Programming and Evolvable Machines
Open issues in genetic programming
Genetic Programming and Evolvable Machines
Predicting problem difficulty for genetic programming applied to data classification
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Morphological image enhancement procedure design by using genetic programming
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Using subtree crossover distance to investigate genetic programming dynamics
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Operator-Based distance for genetic programming: subtree crossover distance
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Analysing the effects of diverse operators in a genetic programming system
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
| Hi-index | 0.00 |
This is the first part of a two-part paper which introduces a general schema theory for genetic programming (GP) with subtree-swapping crossover. The theory is based on a Cartesian node reference system which makes it possible to describe programs as functions over the space N2 and allows one to model the process of selection of the crossover points of subtree-swapping crossovers as a probability distribution over N4. In Part I, we present these notions and models and show how they can be used to calculate useful quantities. In Part II we will show how this machinery, when integrated with other definitions, such as that of variable-arity hyperschema, can be used to construct a general and exact schema theory for the most commonly used types of GP.