Algorithms
Computability and logic
Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming!
Crossover in Grammatical Evolution: A Smooth Operator?
Proceedings of the European Conference on Genetic Programming
Grammatical Evolution: Evolving Programs for an Arbitrary Language
EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
Gene expression programming with DAG chromosome
ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
| Hi-index | 0.00 |
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters or certain primitive constants. This limits the expressiveness of the programs that can be evolved. It is possible to extend the expressiveness of such an approach significantly without leaving the comfort of terminating programs by including primitive recursion as a control operation.The technique used here was gene expression programming [2], a variation of grammatical evolution [8]. Grammatical evolution avoids the problem of program bloat; its separation of genotype (string of symbols) and phenotype (expression tree) permits to optimise the generated programs without interfering with the evolutionary process.