research
∙
10/24/2012
Black-Box Complexity: Breaking the O(n n) Barrier of LeadingOnes
We show that the unrestricted black-box complexity of the n-dimensional ...
share
research
∙
03/19/2012
Reducing the Arity in Unbiased Black-Box Complexity
We show that for all 1<k ≤ n the k-ary unbiased black-box complexity of ...
research
∙
10/17/2011
Playing Mastermind With Constant-Size Memory
We analyze the classic board game of Mastermind with n holes and a const...
research
∙
08/01/2011
Black-Box Complexities of Combinatorial Problems
Black-box complexity is a complexity theoretic measure for how difficult...
research
∙
02/06/2011
Ranking-Based Black-Box Complexity
Randomized search heuristics such as evolutionary algorithms, simulated ...
research
∙
01/04/2011
Multiplicative Drift Analysis
In this work, we introduce multiplicative drift analysis as a suitable w...
research
∙
12/04/2010
Faster Black-Box Algorithms Through Higher Arity Operators
We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-...
research
∙
11/15/2010
Non-Existence of Linear Universal Drift Functions
Drift analysis has become a powerful tool to prove bounds on the runtime...
research
∙
10/07/2010
