We show how the necessary and sufficient conditions for the NFL to apply can be reduced to the single requirement of the set of objective functions under consideration being closed under permutation, and quantify the extent to which a set of objectives not closed under permutation can give rise to a performance difference between two algorithms. Then we provide a more refined definition of performance under which we show that revisiting algorithms are always trumped by enumerative ones.
|Translated title of the contribution||Beyond no free lunch: realistic algorithms for arbitrary problem classes|
|Publisher||Department of Computer Science, University of Bristol|
|Publication status||Published - 2009|
Bibliographical noteOther page information: -
Other identifier: 2001087