Theory of randomized search heuristics : foundations and recent developments /
Randomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last fiv...
Saved in:
| Online Access: |
Full text (MCPHS users only) |
|---|---|
| Other Authors: | , |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Singapore ; Hackensack, NJ :
World Scientific,
2011
|
| Series: | Series on theoretical computer science ;
v. 1. |
| Subjects: | |
| Local Note: | ProQuest Ebook Central |
| Summary: | Randomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last five years, also attempts to explain the success of the methods in practical applications. This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence. Each chapter of this boo. |
|---|---|
| Physical Description: | 1 online resource (x, 359 pages) : illustrations |
| Bibliography: | Includes bibliographical references and index. |
| ISBN: | 9789814282673 9814282677 1283148285 9781283148283 |
| Source of Description, Etc. Note: | Print version record. |
