Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > RANDOMISED SEARCH HEURISTICS:
Reports tagged with randomised search heuristics:
TR10-102 | 12th May 2010
Per Kristian Lehre, Carsten Witt

Black-Box Search by Unbiased Variation

Revisions: 1

The complexity theory for black-box algorithms, introduced by
Droste et al. (2006), describes common limits on the efficiency of
a broad class of randomised search heuristics. There is an
obvious trade-off between the generality of the black-box model
and the strength of the bounds that can be proven in such ... more >>>




ISSN 1433-8092 | Imprint