Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Analyzing Evolutionary Algorithms - The Computer Science Perspective

Analyzing Evolutionary Algorithms

The Computer Science Perspective

Jansen, Thomas

2013, X, 255 p. 19 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$79.95

(net) price for USA

ISBN 978-3-642-17339-4

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$109.00

(net) price for USA

ISBN 978-3-642-17338-7

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • The results presented are derived in detail
  • A useful reference for both graduate students and researchers
  • Each chapter ends with detailed comments and pointers to further reading

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 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.

 

The notational and mathematical basics are covered in an appendix, the results presented are derived in detail, and each chapter ends with detailed comments and pointers to further reading. So the book is a useful reference for both graduate students and researchers engaged with the theoretical analysis of such algorithms.

 

Content Level » Research

Keywords » Black-Box Optimization - Complexity-Theoretical Analysis - Evoluionary Computing (EC) - Evolutionary Algorithms (EAs) - Natural Computing - Randomized Search Heuristics

Related subjects » Artificial Intelligence - Computational Intelligence and Complexity - Mathematics - Theoretical Computer Science

Table of contents / Preface / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Theory of Computation.