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
Handbook of formal languages, vol. 3
Advances in genetic programming
On using syntactic constraints with genetic programming
Advances in genetic programming
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Genetic Programming III: Darwinian Invention & Problem Solving
Genetic Programming III: Darwinian Invention & Problem Solving
Grammatical bias for evolutionary learning
Grammatical bias for evolutionary learning
Collective adaptation: the sharing of building blocks
Collective adaptation: the sharing of building blocks
Evolutionary program induction directed by logic grammars
Evolutionary Computation
Collective adaptation: The exchange of coding segments
Evolutionary Computation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Journal of Computer and System Sciences
Tree adjoining grammars, language bias, and genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
IEEE Transactions on Evolutionary Computation
Analysing the regularity of genomes using compression and expression simplification
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Hi-index | 0.00 |
We empirically investigate the use of dual duplication/truncation operators both as mutation operators and as generic local search operators, in combination with genetic search in a tree adjoining grammar guided genetic programming system (TAG3P). The results show that, on the problems tried, duplication/truncation works well as a mutation operator but not reliably when the complexity of the problem was scaled up. When using these dual operators as a generic local search operator, however, it helped TAG3P not only to solve the problems reliably but also cope well with scalability in problem complexity. Moreover, it managed to solve problems with very small population sizes.