Black-box complexity studies lower bounds for the efficiency of general-purpose black-box optimization algorithms such as evolutionary algorithms and other search heuristics. Different models exist, each one being designed to analyze a different aspect ...
In their GECCO'12 paper, Doerr and Doerr proved that the k-ary unbiased black-box complexity of OneMax on n bits is O(n/k) for 2 ≤ k ≤ log2 n. We propose an alternative strategy for achieving this unbiased black-box complexity when 3 ≤ k ≤ log2 n. While ...
Unbiased black-box complexity was recently introduced as a refined complexity model for randomized search heuristics (Lehre and Witt, GECCO 2010). For several problems, this notion avoids the unrealistically low complexity results given by the classical ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in
