No-Free-Lunch theorems and the diversity of algorithms.
Mario KöppenPublished in: IEEE Congress on Evolutionary Computation (2004)
Keyphrases
- times faster
- learning algorithm
- combinatorial optimization
- data structure
- computational complexity
- theoretical analysis
- neural network
- data mining
- information systems
- significant improvement
- graph theory
- database
- recently developed
- computationally expensive
- optimization problems
- probabilistic model
- np hard
- multi objective
- multiscale
- artificial intelligence
- real world
- real time