Title: No free lunch and benchmarks
Authors: Duéñez-Guzmán, Edgar ×
Vose, Michael #
Issue Date: Mar-2013
Publisher: MIT Press
Series Title: Evolutionary Computation vol:21 issue:2 pages:293-312
Abstract: We extend previous results concerning Black-Box search algorithms, presenting new theoretical tools related to No Free Lunch (NFL) where functions are restricted to some Benchmark (that need not be permutation closed), algorithms are restricted to some collection (that need not be permutation closed) or limited to some number of steps, or the performance measure is given. “Minimax distinctions” are considered from a geometric perspective, and basic results on performance matching are also presented.
ISSN: 1063-6560
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Non-KU Leuven Association publications
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
Duenez-Guzman2012.pdfManuscript Published 390KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science