|
No Free Lunch asserts that the behavior of all possible search algorithms are equivalent when compared over all possible discrete functions. No Free Lunch has also been shown to hold over all possible representations and over finite permutation sets. The tutorial will discuss the implications and limitations of No Free Lunch.
|
