Theory and Principled Methods for the Design of Metaheuristics - Natural Computing Series
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642332050, 9783642332067

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms

Theory and Principled Methods for the Design of Metaheuristics - Natural Computing Series ◽

10.1007/978-3-642-33206-7_2 ◽

2013 ◽

pp. 25-39 ◽

Cited By ~ 1

Author(s):

Fabien Teytaud ◽

Olivier Teytaud

Keyword(s):

Evolutionary Algorithms ◽

Convergence Rates ◽

Parallel Evolutionary Algorithms

Download Full-text

Rugged and Elementary Landscapes

Theory and Principled Methods for the Design of Metaheuristics - Natural Computing Series ◽

10.1007/978-3-642-33206-7_3 ◽

2013 ◽

pp. 41-61 ◽

Cited By ~ 3

Author(s):

Konstantin Klemm ◽

Peter F. Stadler

Download Full-text

Principled Design of Continuous Stochastic Search: From Theory to Practice

Theory and Principled Methods for the Design of Metaheuristics - Natural Computing Series ◽

10.1007/978-3-642-33206-7_8 ◽

2013 ◽

pp. 145-180 ◽

Cited By ~ 21

Author(s):

Nikolaus Hansen ◽

Anne Auger

Keyword(s):

Stochastic Search ◽

Theory To Practice ◽

Principled Design

Download Full-text

Designing an Optimal Search Algorithm with Respect to Prior Information

Theory and Principled Methods for the Design of Metaheuristics - Natural Computing Series ◽

10.1007/978-3-642-33206-7_6 ◽

2013 ◽

pp. 111-128

Author(s):

Olivier Teytaud ◽

Emmanuel Vazquez

Keyword(s):

Prior Information ◽

Search Algorithm ◽

Optimal Search

Download Full-text

Formal Search Algorithms + Problem Characterisations = Executable Search Strategies

Theory and Principled Methods for the Design of Metaheuristics - Natural Computing Series ◽

10.1007/978-3-642-33206-7_11 ◽

2013 ◽

pp. 247-270 ◽

Cited By ~ 3

Author(s):

Patrick D. Surry ◽

Nicholas J. Radcliffe

Keyword(s):

Search Strategies ◽

Search Algorithms

Download Full-text

Experimental Analysis of Optimization Algorithms: Tuning and Beyond

Theory and Principled Methods for the Design of Metaheuristics - Natural Computing Series ◽

10.1007/978-3-642-33206-7_10 ◽

2013 ◽

pp. 205-245 ◽

Cited By ~ 4

Author(s):

Thomas Bartz-Beielstein ◽

Mike Preuss

Keyword(s):

Experimental Analysis ◽

Optimization Algorithms

Download Full-text

The Bayesian Search Game

Theory and Principled Methods for the Design of Metaheuristics - Natural Computing Series ◽

10.1007/978-3-642-33206-7_7 ◽

2013 ◽

pp. 129-144 ◽

Cited By ~ 1

Author(s):

Marc Toussaint

Keyword(s):

Search Game

Download Full-text

Parsimony Pressure Made Easy: Solving the Problem of Bloat in GP

Theory and Principled Methods for the Design of Metaheuristics - Natural Computing Series ◽

10.1007/978-3-642-33206-7_9 ◽

2013 ◽

pp. 181-204 ◽

Cited By ~ 7

Author(s):

Riccardo Poli ◽

Nicholas Freitag McPhee

Keyword(s):

Parsimony Pressure

Download Full-text

Single-Funnel and Multi-funnel Landscapes and Subthreshold-Seeking Behavior

Theory and Principled Methods for the Design of Metaheuristics - Natural Computing Series ◽

10.1007/978-3-642-33206-7_4 ◽

2013 ◽

pp. 63-84

Author(s):

Darrell Whitley ◽

Jonathan Rowe

Keyword(s):

Seeking Behavior

Download Full-text

No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics

Theory and Principled Methods for the Design of Metaheuristics - Natural Computing Series ◽

10.1007/978-3-642-33206-7_1 ◽

2013 ◽

pp. 1-23 ◽

Cited By ~ 5

Author(s):

Christian Igel

Keyword(s):

Free Lunch ◽

No Free Lunch Theorems ◽

No Free Lunch

Download Full-text

Theory and Principled Methods for the Design of Metaheuristics - Natural Computing SeriesLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms

Rugged and Elementary Landscapes

Principled Design of Continuous Stochastic Search: From Theory to Practice

Designing an Optimal Search Algorithm with Respect to Prior Information

Formal Search Algorithms + Problem Characterisations = Executable Search Strategies

Experimental Analysis of Optimization Algorithms: Tuning and Beyond

The Bayesian Search Game

Parsimony Pressure Made Easy: Solving the Problem of Bloat in GP

Single-Funnel and Multi-funnel Landscapes and Subthreshold-Seeking Behavior

No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics

Theory and Principled Methods for the Design of Metaheuristics - Natural Computing Series
Latest Publications