Probability and Measure, 1986. ,
Some multiobjective optimizers are better than others, The 2003 Congress on Evolutionary Computation, 2003. CEC '03., 2003. ,
DOI : 10.1109/CEC.2003.1299403
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.9738
On the Futility of Blind Search: An Algorithmic View of ???No Free Lunch???, Evolutionary Computation, vol.18, issue.3, pp.109-127, 1998. ,
DOI : 10.1109/4235.585893
Stochastic process measurability conditions, Annales de l???institut Fourier, vol.25, issue.3-4, pp.163-176, 1975. ,
DOI : 10.5802/aif.577
Perhaps Not a Free Lunch But At Least a Free Appetizer, Proceedings of theFirstGenetic and Evolutionary Computation Conference(GECCO '99), pp.833-839, 1999. ,
Optimization with randomized search heuristics???the (A)NFL theorem, realistic scenarios, and difficult functions, Theoretical Computer Science, vol.287, issue.1, pp.131-144, 2002. ,
DOI : 10.1016/S0304-3975(02)00094-4
A No-Free-Lunch theorem for non-uniform distributions of target functions, Journal of Mathematical Modelling and Algorithms, vol.1, issue.(1), pp.313-322, 2004. ,
DOI : 10.1007/s10852-005-2586-y
Foundations of the theory of Probability (original: Grundbegriffe der Wahrscheinlichkeitsrechnung) Chelsea publishing company, 1933. ,
Fundamental limitations on search algorithms: Evolutionary computing in perspective, Lecture Notes in Computer Science, 1995. ,
DOI : 10.1007/BFb0015249
The No Free Lunch and Problem Description Length ,
Random Fields: Analysis & Synthesis, Journal of Vibration Acoustics Stress and Reliability in Design, vol.107, issue.2, 1998. ,
DOI : 10.1115/1.3269255
No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, vol.1, issue.1, pp.67-82, 1997. ,
DOI : 10.1109/4235.585893