Analyzing Evolutionary Algorithms The Computer Science Perspective /
Evolutionary algorithms is a class of randomized heuristics inspired by natural evolution. They are applied in many different contexts, in particular in optimization, and analysis of such algorithms has seen tremendous advances in recent years. � In this book the author provides an introduction to t...
Main Author: | |
---|---|
Corporate Author: | |
Format: | Electronic |
Language: | English |
Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2013.
|
Series: | Natural Computing Series,
|
Subjects: | |
Online Access: | https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-17339-4 |
Table of Contents:
- Introduction
- Evolutionary Algorithms and Other Randomized Search Heuristics
- Theoretical Perspectives on Evolutionay Algorithms
- General Limits in Black-Box Optimization
- Methods for the Analysis of Evolutionary Algorithms
- Selected Topics in the Analysis of Evolutionary Algorithms
- App. A, Landau Notation
- App. B, Tail Estimations
- App. C, Martingales and Applications.