| |
| Title | Analyzing evolutionary algorithms: The Computer Science Perspective |
| Author(s) | Thomas Jansen |
| Publication | Heidelberg, Springer, 2013. |
| Description | x, 255p. |
| Series | (Natural Computing Series) |
| Abstract Note | n this book the author provides an introduction to the methods used to analyze evolutionary algorithms and other randomized search heuristics. He starts with an algorithmic and modular perspective and gives guidelines for the design of evolutionary algorithms. He then places the approach in the broader research context with a chapter on theoretical perspectives. By adopting a complexity-theoretical perspective, he derives general limitations for black-box optimization, yielding lower bounds on the performance of evolutionary algorithms, and then develops general methods for deriving upper and lower bounds step by step. This main part is followed by a chapter covering practical applications of these methods. |
| ISBN,Price | 9783642173387 : Euro 84.95(HB) |
| Classification | 681.3.06:510.5
|
| Keyword(s) | 1. ALGORITHMS
2. ANALYSIS
3. COMPLEXITY
4. EBOOK
5. EBOOK - SPRINGER
6. EVOLUTIONARY ALGORITHMS
7. NATURAL COMPUTING
|
| Item Type | Book |
Multi-Media Links
Please Click here for eBook
Circulation Data
| Accession# | |
Call# | Status | Issued To | Return Due On | Physical Location |
| 024750 |
|
681.3.06:510.5/JAN/024750 |
On Shelf |
|
|
|
| I11984 |
|
681.3.06:510.5/JAN/ |
On Shelf |
|
|
|
+Copy Specific Information |