16 search results - page 1 / 4 » The no free lunch and realistic search algorithms |
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
CEC
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
The No-Free-Lunch theorem is a fundamental result in the field of black-box function optimization. Recent work has shown that coevolution can exhibit free lunches. The question a...
EVOW
2004
Springer
13 years 10 months ago
2004
Springer
In sequential, deterministic, non-redundant search the algorithm permutes a test function to obtain the search result. The mapping from test functions to search results is a one-to...
BIOADIT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...