Studies in artificial evolution
Studies in artificial evolution
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
The evolution of mental models
Advances in genetic programming
Recombination, selection, and the genetic construction of computer programs
Recombination, selection, and the genetic construction of computer programs
Data structures and genetic programming
Advances in genetic programming
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Temporal Data Processing Using Genetic Programming
Proceedings of the 6th International Conference on Genetic Algorithms
Evolving Data Structures with Genetic Programming
Proceedings of the 6th International Conference on Genetic Algorithms
Solving Complex Problems with Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Parsing and translation of expressions by genetic programming
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Provision of appropriately structured memory is shown, in some cases, to be advantageous to genetic programming (GP) in comparison with directly addressable indexed memory. Three "classic" problems are solved. The first two require the GP to distinguish between sentences that are in a context free language and those that are not given positive and negative training examples of the language. The two languages are, correctly nested brackets and a Dyck language (correctly nested brackets of different types). The third problem is to evaluate integer Reverse Polish (postfix) expressions. Comparisons are made between GP attempting to solve these problems when provided with indexed memory or with stack data structures.