The (μ+1) EA optimizes BinVal in O(μ log μ · n log n) evaluations for μ = o(n/log n), improving the prior O(μ^5 n log(n/μ^4)) bound.
Theoretical Computer Science276(1–2), 51–81 (Apr 2002)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.NE 2years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
Self-adjusting mutation rates let the (1+1) EA optimize the top k bits of BinVal in O(k^{1+ε}) time independent of n for all k in o(n) simultaneously.
citing papers explorer
-
Anytime Analysis on BinVal: Adaptive Parameters Help
Self-adjusting mutation rates let the (1+1) EA optimize the top k bits of BinVal in O(k^{1+ε}) time independent of n for all k in o(n) simultaneously.