Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming-Reference-Cited by-同舟云学术

Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming

Published:2018 Issue: Volume: Page:42-54
ISSN:0302-9743
Container-title:Parallel Problem Solving from Nature – PPSN XV
language:
Short-container-title:

Author:

Kötzing Timo,Lagodzinski J. A. Gregor,Lengler Johannes,Melnichenko Anna

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-99259-4_4

Reference22 articles.

1. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

2. Doerr, B., Kötzing, T., Lagodzinski, J.A.G., Lengler, J.: Bounding bloat in genetic programming. In: Proceedings of GECCO 2017, pp. 921–928. ACM (2017)

3. Durrett, G., Neumann, F., O’Reilly, U.M.: Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. In: Proceedings of FOGA 2011, pp. 69–80 (2011)

4. Lecture Notes in Computer Science;BE Eskridge,2004

5. Gathercole, C., Ross, P.: An adverse interaction between the crossover operator and a restriction on tree depth. In: Proceedings of GP 1996, pp. 291–296 (1996)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exponential slowdown for larger populations: The (μ + 1)-EA on monotone functions;Theoretical Computer Science;2021-07

2. The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time;Theoretical Computer Science;2020-05

3. On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions;Journal of Artificial Intelligence Research;2019-11-12

4. Exponential slowdown for larger populations;Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms - FOGA '19;2019