Theory of Evolutionary Computation: Recent Developments in Discrete Optimization: Natural Computing Series
Editat de Benjamin Doerr, Frank Neumannen Limba Engleză Paperback – 3 dec 2020
It starts with two chapters on mathematical methods that are often used in the analysis of randomized search heuristics, followed by three chapters on how to measure the complexity of a search heuristic: black-box complexity, a counterpart of classical complexity theory in black-box optimization; parameterized complexity, aimed at a more fine-grained view of the difficulty of problems; and the fixed-budget perspective, which answers the question of how good a solution will be after investing a certain computational budget. The book then describes theoretical results on three important questions in evolutionary computation: how to profit from changing the parameters during the run of an algorithm; how evolutionary algorithms cope with dynamically changing or stochastic environments; and how population diversity influencesperformance. Finally, the book looks at three algorithm classes that have only recently become the focus of theoretical work: estimation-of-distribution algorithms; artificial immune systems; and genetic programming.
Throughout the book the contributing authors try to develop an understanding for how these methods work, and why they are so successful in many applications. The book will be useful for students and researchers in theoretical computer science and evolutionary computing.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 1424.42 lei 6-8 săpt. | |
Springer International Publishing – 3 dec 2020 | 1424.42 lei 6-8 săpt. | |
Hardback (1) | 1430.88 lei 6-8 săpt. | |
Springer International Publishing – 4 dec 2019 | 1430.88 lei 6-8 săpt. |
Din seria Natural Computing Series
- 20% Preț: 507.37 lei
- 20% Preț: 544.29 lei
- 20% Preț: 305.90 lei
- 20% Preț: 972.14 lei
- 20% Preț: 629.65 lei
- 20% Preț: 977.81 lei
- 20% Preț: 641.95 lei
- 18% Preț: 944.07 lei
- 20% Preț: 617.13 lei
- 20% Preț: 632.40 lei
- 20% Preț: 615.69 lei
- 20% Preț: 641.78 lei
- Preț: 376.97 lei
- 20% Preț: 639.35 lei
- 20% Preț: 636.14 lei
- 20% Preț: 324.09 lei
- 20% Preț: 321.49 lei
- Preț: 381.87 lei
- 20% Preț: 327.16 lei
- 20% Preț: 631.62 lei
- 20% Preț: 632.58 lei
- 20% Preț: 627.24 lei
- 20% Preț: 1272.95 lei
- 15% Preț: 626.97 lei
- 20% Preț: 322.43 lei
- 20% Preț: 644.51 lei
- 20% Preț: 645.97 lei
- 20% Preț: 517.81 lei
- 20% Preț: 977.35 lei
- 20% Preț: 498.33 lei
- Preț: 392.79 lei
- 20% Preț: 640.16 lei
- 20% Preț: 308.60 lei
- 20% Preț: 640.80 lei
- 20% Preț: 635.00 lei
- 15% Preț: 638.99 lei
- 20% Preț: 329.76 lei
Preț: 1424.42 lei
Preț vechi: 1780.53 lei
-20% Nou
Puncte Express: 2137
Preț estimativ în valută:
272.63€ • 283.38$ • 225.83£
272.63€ • 283.38$ • 225.83£
Carte tipărită la comandă
Livrare economică 05-19 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030294168
ISBN-10: 3030294161
Ilustrații: XII, 506 p. 27 illus., 17 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.74 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seria Natural Computing Series
Locul publicării:Cham, Switzerland
ISBN-10: 3030294161
Ilustrații: XII, 506 p. 27 illus., 17 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.74 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seria Natural Computing Series
Locul publicării:Cham, Switzerland
Cuprins
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics.- Drift Analysis.- Complexity Theory for Discrete Black-Box Optimization Heuristics.- Parameterized Complexity Analysis of Randomized Search Heuristics.- Analysing Stochastic Search Heuristics Operating on a Fixed Budget.- Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices.- Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments.- The Benefits of Population Diversity in Evolutionary Algorithms: A Survey of Rigorous Runtime Analyses.- Theory of Estimation-of-Distribution Algorithms.- Theoretical Foundations of Immune-Inspired Randomized Search Heuristics for Optimization.- Computational Complexity Analysis of Genetic Programming.
Textul de pe ultima copertă
This edited book reports on recent developments in the theory of evolutionary computation, or more generally the domain of randomized search heuristics.
It starts with two chapters on mathematical methods that are often used in the analysis of randomized search heuristics, followed by three chapters on how to measure the complexity of a search heuristic: black-box complexity, a counterpart of classical complexity theory in black-box optimization; parameterized complexity, aimed at a more fine-grained view of the difficulty of problems; and the fixed-budget perspective, which answers the question of how good a solution will be after investing a certain computational budget. The book then describes theoretical results on three important questions in evolutionary computation: how to profit from changing the parameters during the run of an algorithm; how evolutionary algorithms cope with dynamically changing or stochastic environments; and how population diversity influencesperformance. Finally, the book looks at three algorithm classes that have only recently become the focus of theoretical work: estimation-of-distribution algorithms; artificial immune systems; and genetic programming.
Throughout the book the contributing authors try to develop an understanding for how these methods work, and why they are so successful in many applications. The book will be useful for students and researchers in theoretical computer science and evolutionary computing.
It starts with two chapters on mathematical methods that are often used in the analysis of randomized search heuristics, followed by three chapters on how to measure the complexity of a search heuristic: black-box complexity, a counterpart of classical complexity theory in black-box optimization; parameterized complexity, aimed at a more fine-grained view of the difficulty of problems; and the fixed-budget perspective, which answers the question of how good a solution will be after investing a certain computational budget. The book then describes theoretical results on three important questions in evolutionary computation: how to profit from changing the parameters during the run of an algorithm; how evolutionary algorithms cope with dynamically changing or stochastic environments; and how population diversity influencesperformance. Finally, the book looks at three algorithm classes that have only recently become the focus of theoretical work: estimation-of-distribution algorithms; artificial immune systems; and genetic programming.
Throughout the book the contributing authors try to develop an understanding for how these methods work, and why they are so successful in many applications. The book will be useful for students and researchers in theoretical computer science and evolutionary computing.
Caracteristici
Many advances have been made in this field in the last ten years Concise summary of the state of the art for graduate students and researchers Book covers the development of more powerful methods, the solution of longstanding open problems, and the analysis of new heuristics