Reducing the arity in unbiased black-box complexity-Reference-Cited by-同舟云学术

Reducing the arity in unbiased black-box complexity

Published:2014-08 Issue: Volume:545 Page:108-121
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Doerr Benjamin,Winzen Carola

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference22 articles.

1. Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Kasper Green Larsen, Kurt Mehlhorn, Carola Winzen, The deterministic and randomized query complexity of a simple guessing game, in: Electronic Colloquium on Computational Complexity, ECCC, TR12-087, 2012. Available online at http://eccc.hpi-web.de/report/2012/087/.

2. Black-box search by elimination of fitness functions;Anil,2009

3. Mastermind;Chvátal;Combinatorica,1983

4. Crossover can provably be useful in evolutionary computation;Doerr;Theoretical Computer Science,2012

5. Faster black-box algorithms through higher arity operators;Doerr,2011

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

1. Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions;Algorithmica;2024-07-22

2. Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches;Proceedings of the Companion Conference on Genetic and Evolutionary Computation;2023-07-15

3. Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions;Proceedings of the Genetic and Evolutionary Computation Conference;2023-07-12

4. Theoretical and empirical study of the (1 + (λ, λ)) EA on the leadingones problem;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2019-07-13

5. Limited memory, limited arity unbiased black-box complexity;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2019-07-13