Graphical evolution: an introduction to the theory of random graphs
Graphical evolution: an introduction to the theory of random graphs
Almost all k-colorable graphs are easy to color
Journal of Algorithms
Foundations of genetic algorithms
Foundations of genetic algorithms
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fundamentals of algorithmics
Introduction to Computer Theory
Introduction to Computer Theory
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
Mutation-crossover isomorphisms and the construction of discriminating functions
Evolutionary Computation
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Embedding Branch and Bound within Evolutionary Algorithms
Applied Intelligence
Theoretical Computer Science - Natural computing
Functions as Permutations: Regarding No Free Lunch, Walsh Analysis and Summary Statistics
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
On the design of problem-specific evolutionary algorithms
Advances in evolutionary computing
Basic principles for understanding evolutionary algorithms
Fundamenta Informaticae
Space Complexity of Estimation of Distribution Algorithms
Evolutionary Computation
A hybridized genetic parallel programming based logic circuit synthesizer
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Subthreshold-seeking local search
Theoretical Computer Science - Foundations of genetic algorithms
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
Journal of Artificial Intelligence Research
Conservation of information in search: measuring the cost of success
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Adaptation and Evolution in Dynamic Persistent Environments
Electronic Notes in Theoretical Computer Science (ENTCS)
On preprocessing data for financial credit risk evaluation
Expert Systems with Applications: An International Journal
Bernoulli's principle of insufficient reason and conservation of information in computer search
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Two broad classes of functions for which a no free lunch result does not hold
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Free lunches on the discrete Lipschitz class
Theoretical Computer Science
A solution to the exact match on rare item searches: introducing the lost sheep algorithm
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
A clustering method combining differential evolution with the K-means algorithm
Pattern Recognition Letters
Self-adaptive learning based particle swarm optimization
Information Sciences: an International Journal
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Heuristic colour assignment strategies for merge models in graph colouring
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
A Neural-Network Controlled Dynamic Evolutionary Scheme for Global Molecular Geometry Optimization
International Journal of Applied Mathematics and Computer Science - Issues in Advanced Control and Diagnosis
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Basic principles for understanding evolutionary algorithms
Fundamenta Informaticae
Towards objective measures of algorithm performance across instance space
Computers and Operations Research
| Hi-index | 0.00 |
The paper is in three parts. First, we use simple adversary arguments to redevelop and explore some of the no-free-lunch (NFL) theorems and perhaps extend them a little. Second, we clarify the relationship of NFL theorems to algorithm theory and complexity classes such as NP. We claim that NFL is weaker in the sense that the constraints implied by the conjectures of traditional algorithm theory on what an evolutionary algorithm may be expected to accomplish are far more severe than those implied by NFL. Third, we take a brief look at how natural evolution relates to computation and optimization. We suggest that the evolution of complex systems exhibiting high degrees of orderliness is not equivalent in difficulty to optimizing hard (in the complexity sense) problems, and that the optimism in genetic algorithms (GAs) as universal optimizers is not justified by natural evolution. This is an informal tutorial paper---most of the information presented is not formally proven, and is either “common knowledge” or formally proven elsewhere. Some of the claims are intuitions based on experience with algorithms, and in a more formal setting should be classified as conjectures.