default search action
Theory and Principled Methods for the Design of Metaheuristics 2014
- Yossi Borenstein, Alberto Moraglio:
Theory and Principled Methods for the Design of Metaheuristics. Natural Computing Series, Springer 2014, ISBN 978-3-642-33205-0 - Christian Igel:
No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics. 1-23 - Fabien Teytaud, Olivier Teytaud:
Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms. 25-39 - Konstantin Klemm, Peter F. Stadler:
Rugged and Elementary Landscapes. 41-61 - L. Darrell Whitley, Jonathan E. Rowe:
Single-Funnel and Multi-funnel Landscapes and Subthreshold-Seeking Behavior. 63-84 - Thomas Jansen:
Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics. 85-110 - Olivier Teytaud, Emmanuel Vázquez:
Designing an Optimal Search Algorithm with Respect to Prior Information. 111-128 - Marc Toussaint:
The Bayesian Search Game. 129-144 - Nikolaus Hansen, Anne Auger:
Principled Design of Continuous Stochastic Search: From Theory to Practice. 145-180 - Riccardo Poli, Nicholas Freitag McPhee:
Parsimony Pressure Made Easy: Solving the Problem of Bloat in GP. 181-204 - Thomas Bartz-Beielstein, Mike Preuss:
Experimental Analysis of Optimization Algorithms: Tuning and Beyond. 205-245 - Patrick D. Surry, Nicholas J. Radcliffe:
Formal Search Algorithms + Problem Characterisations = Executable Search Strategies. 247-270
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.