Computational Complexity Analysis of Genetic Programming - Initial Results and Future Directions
Files
(Restricted Access)
Date
2011
Authors
Neumann, F.
O'Reilly, U.
Wagner, M.
Editors
Riolo, R.
Vladislavleva, E.
Moore, J.
Vladislavleva, E.
Moore, J.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Book chapter
Citation
Genetic Programming Theory and Practice IX, 2011 / Riolo, R., Vladislavleva, E., Moore, J. (ed./s), pp.113-128
Statement of Responsibility
Frank Neumann, Una-May O’Reilly and Markus Wagner
Conference Name
Abstract
The computational complexity analysis of evolutionary algorithmsworking on binary strings has significantly increased the rigorous understanding on how these types of algorithm work. Similar results on the computational complexity of genetic programming would fill an important theoretic gap. They would significantly increase the theoretical understanding on how and why genetic programming algorithms work and indicate, in a rigorous manner, how design choices of algorithm components impact its success. We summarize initial computational complexity results for simple tree-based genetic programming and point out directions for future research.
School/Discipline
Dissertation Note
Provenance
Description
Genetic and Evolutionary Computation Series