\textsc{OneMax} in black-box models with several restrictions

DOI10.1007/s00453-016-0168-1zbMath1366.68260arXiv1504.02644OpenAlexW2404852716MaRDI QIDQ2362361

Johannes Lengler, Carola Doerr

Publication date: 7 July 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.02644

zbMATH Keywords

evolutionary computationtruncation selectionblack-box complexitycomparison-based\textsc{OneMax}elitistmemory-restrictedranking-based

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

\textsc{OneMax} in black-box models with several restrictions ⋮ Fixed-target runtime analysis ⋮ On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization ⋮ The \((1+1)\) elitist black-box complexity of LeadingOnes ⋮ The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• From black-box complexity to designing new genetic algorithms
• Simplified drift analysis for proving lower bounds in evolutionary computation
• Black-box search by unbiased variation
• Reducing the arity in unbiased black-box complexity
• Playing mastermind with constant-size memory
• \textsc{OneMax} in black-box models with several restrictions
• Upper and lower bounds for randomized search heuristics in black-box optimization
• Preferential Arrangements
• Black-box search by elimination of fitness functions
• Faster black-box algorithms through higher arity operators

This page was built for publication: \textsc{OneMax} in black-box models with several restrictions