Computer Science – Neural and Evolutionary Computing
Scientific paper
2001-08-21
Computer Science
Neural and Evolutionary Computing
8 pages, 1 figure, see http://www.neuroinformatik.ruhr-uni-bochum.de/
Scientific paper
In a recent paper it was shown that No Free Lunch results hold for any subset F of the set of all possible functions from a finite set X to a finite set Y iff F is closed under permutation of X. In this article, we prove that the number of those subsets can be neglected compared to the overall number of possible subsets. Further, we present some arguments why problem classes relevant in practice are not likely to be closed under permutation.
Igel Christian
Toussaint Marc
No associations
LandOfFree
On Classes of Functions for which No Free Lunch Results Hold does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Classes of Functions for which No Free Lunch Results Hold, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Classes of Functions for which No Free Lunch Results Hold will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-622898