Theory and Principled Methods for the Design of Metaheuristics - researchr publication

researchr

You are not signed in
Sign in
Sign up

Yossi Borenstein, Alberto Moraglio, editors, Theory and Principled Methods for the Design of Metaheuristics. Natural Computing Series, Springer, 2014. [doi]

Abstract is missing.

No Free Lunch Theorems: Limitations and Perspectives of MetaheuristicsChristian Igel. 1-23 [doi]

Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary AlgorithmsFabien Teytaud, Olivier Teytaud. 25-39 [doi]

Rugged and Elementary LandscapesKonstantin Klemm, Peter F. Stadler. 41-61 [doi]

Single-Funnel and Multi-funnel Landscapes and Subthreshold-Seeking BehaviorDarrell Whitley, Jonathan E. Rowe. 63-84 [doi]

Black-Box Complexity for Bounding the Performance of Randomized Search HeuristicsThomas Jansen. 85-110 [doi]

Designing an Optimal Search Algorithm with Respect to Prior InformationOlivier Teytaud, Emmanuel Vázquez. 111-128 [doi]

The Bayesian Search GameMarc Toussaint. 129-144 [doi]

Principled Design of Continuous Stochastic Search: From Theory to PracticeNikolaus Hansen, Anne Auger. 145-180 [doi]

Parsimony Pressure Made Easy: Solving the Problem of Bloat in GPRiccardo Poli, Nicholas Freitag McPhee. 181-204 [doi]

Experimental Analysis of Optimization Algorithms: Tuning and BeyondThomas Bartz-Beielstein, Mike Preuss. 205-245 [doi]

Formal Search Algorithms + Problem Characterisations = Executable Search StrategiesPatrick D. Surry, Nicholas J. Radcliffe. 247-270 [doi]

runs on WebDSL