Memory-restricted black-box complexity of OneMax
From MaRDI portal
Publication:763484
DOI10.1016/J.IPL.2011.10.004zbMATH Open1233.68235OpenAlexW1991060790MaRDI QIDQ763484FDOQ763484
Authors: Benjamin Doerr, Carola Winzen 
Publication date: 9 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.004
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Analysis of algorithms (68W40)
Cites Work
- Upper and lower bounds for randomized search heuristics in black-box optimization
- Title not available (Why is that?)
- Complexity measures and decision tree complexity: a survey.
- On the analysis of the \((1+1)\) evolutionary algorithm
- Title not available (Why is that?)
- Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity
Cited In (8)
- Black-box complexity: advantages of memory usage
- Optimal parameter choices via precise black-box analysis
- The \((1+1)\) elitist black-box complexity of LeadingOnes
- Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory
- \textsc{OneMax} in black-box models with several restrictions
- The unbiased black-box complexity of partition is polynomial
- Playing mastermind with constant-size memory
- Reducing the arity in unbiased black-box complexity
This page was built for publication: Memory-restricted black-box complexity of OneMax
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763484)
