Scalable Optimization via Probabilistic ModelingFrom Algorithms to Applications
Author(s): Martin Pelikan, Kumara Sastry, Erick Cant-Paz
Format: Paperback
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Germany
Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
ISBN-13: 9783642071164, 978-3642071164
Synopsis
Im not usually a fan of edited volumes. Too often they are an incoherent hodgepodge of remnants, renegades, or rejects foisted upon an unsuspecting reading public under a misleading or fraudulent title. The volume Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications is a worthy addition to your library because it succeeds on exactly those dimensions where so many edited volumes fail. For example, take the title, Scalable Optimization via Probabilistic M- eling: From Algorithms to Applications. You need not worry that youre going to pick up this book and ?nd stray articles about anything else. This book compu- tion over the last decade or so: estimation of distribution algorithms (EDAs). EDAs borrow evolutionary computations population orientation and sel- tionism and throw out the genetics to give us a hybrid of substantial power, elegance, and extensibility. The article sequencing in most edited volumes is hard to understand, but from the get go the editors of this volume have assembled a set of articles sequenced in a logical fashion. The book moves from design to e?ciency enhancement and then concludes with relevant applications. The emphasis on e?ciency enhancement is particularly important, because the data-mining ods of data-guided adaptation that can further speed solutions through the construction and utilization of e?ective surrogates, hybrids, and parallel and temporal decompositions.
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.