Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity

DOI10.1007/978-3-642-20712-9_2zbMath1330.68110OpenAlexW1589717837MaRDI QIDQ3007613

Carola Winzen, Benjamin Doerr

Publication date: 17 June 2011

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (7)

More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments ⋮ Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity ⋮ Reducing the arity in unbiased black-box complexity ⋮ Ranking-based black-box complexity ⋮ Toward a unifying framework for evolutionary processes ⋮ Memory-restricted black-box complexity of OneMax ⋮ Unbiasedness of estimation-of-distribution algorithms

Cites Work

• Minimization algorithms and random walk on the d-cube
• Local optimization on graphs
• Lower bounds on the worst-case complexity of some oracle algorithms
• Black-box search by unbiased variation
• Upper and lower bounds for randomized search heuristics in black-box optimization
• Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
• Black-box search by elimination of fitness functions
• Faster black-box algorithms through higher arity operators
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity