Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics

Thomas Jansen. Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics. In Yossi Borenstein, Alberto Moraglio, editors, Theory and Principled Methods for the Design of Metaheuristics. Natural Computing Series, pages 85-110, Springer, 2014. [doi]

Abstract

Abstract is missing.