• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Theory and Principled Methods for the Design of Metaheuristics

Theory and Principled Methods for the Design of Metaheuristics

Paperback

Series: Natural Computing

Business GeneralGeneral ComputersGeneral Mathematics

ISBN10: 3662519550
ISBN13: 9783662519554
Publisher: Springer Nature
Published: Aug 23 2016
Pages: 270
Weight: 0.91
Height: 0.61 Width: 6.14 Depth: 9.21
Language: English
No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics.- Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms.- Rugged and Elementary Landscapes.- Single-Funnel and Multi-funnel Landscapes and Subthreshold Seeking Behavior.- Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics.- Designing an Optimal Search Algorithm with Respect to Prior Information.- The Bayesian Search Game.- Principled Design of Continuous Stochastic Search: From Theory to Practice.- Parsimony Pressure Made Easy: Solving the Problem of Bloat in GP.- Experimental Analysis of Optimization Algorithms: Tuning and Beyond.- Formal Search Algorithms + Problem Characterizations = Executable Search Strategies.

Also in

General Mathematics