Analyzing Evolutionary Algorithms: The Computer Science Perspective (Natural Computing Series) - Hardcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
The author lectured and researched in the Technische Universität Dortmund for 9 years after his PhD, and he is now the Stokes College Lecturer in the Department of Computer Science in University College Cork. He has tested the book content in his own lectures at these universities, and he has been invited to run the tutorial on this subject at the main international conference on evolutionary computing, GECCO.
From the Back Cover
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.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Analyzing Evolutionary Algorithms: The Computer Science...
Seller Image
Analyzing Evolutionary Algorithms
Published by
Springer Berlin Heidelberg Dez 2012, 2012
ISBN 10: 3642173381
ISBN 13: 9783642173387
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 268 pp. Englisch. Seller Inventory # 9783642173387
Stock Image
Analyzing Evolutionary Algorithms
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 268. Seller Inventory # 182450429
International Edition
ANALYZING EVOLUTIONARY ALGORITHMS: THE COMPUTER SCIENCE PERSPECTIVE (NATURAL COMPUTING SERIES)
International EditionSeller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Brand New. Soft Cover International Edition. Different ISBN and Cover Image. Priced lower than the standard editions which is usually intended to make them more affordable for students abroad. The core content of the book is generally the same as the standard edition. The country selling restrictions may be printed on the book but is no problem for the self-use. This Item maybe shipped from US or any other country as we have multiple locations worldwide. Seller Inventory # ABNR-219623
Stock Image
ANALYZING EVOLUTIONARY ALGORITHMS: THE COMPUTER SCIENCE PERSPECTIVE (NATURAL COMPUTING SERIES)
Seller: SMASS Sellers, IRVING, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed. Seller Inventory # ASNT3-219623
Seller Image
Analyzing Evolutionary Algorithms
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2012, 2012
ISBN 10: 3642173381
ISBN 13: 9783642173387
New
Hardcover
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 268 pp. Englisch. Seller Inventory # 9783642173387
Seller Image
Analyzing Evolutionary Algorithms : The Computer Science Perspective
Published by
Springer Berlin Heidelberg, 2012
ISBN 10: 3642173381
ISBN 13: 9783642173387
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783642173387
Seller Image
Analyzing Evolutionary Algorithms | The Computer Science Perspective
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Analyzing Evolutionary Algorithms | The Computer Science Perspective | Thomas Jansen | Buch | x | Englisch | 2012 | Springer-Verlag GmbH | EAN 9783642173387 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Seller Inventory # 106961997