Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary Algorithms - Studies in Fuzziness and Soft Computing - Martin Pelikan - Knjige - Springer-Verlag Berlin and Heidelberg Gm - 9783642062735 - 21. oktobra 2010
Če se naslovnica in naslov ne ujemata, je naslov pravilen

Martin Pelikan
Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary Algorithms - Studies in Fuzziness and Soft Computing Softcover Reprint of Hardcover 1st Ed. 2005 edition

Cena
€ 60,49

Naročeno iz oddaljenega skladišča

Predvidena dobava 7. - 21. avg
Prejemajte obvestila o novih izdajah izvajalca Martin Pelikan

Kaj pravijo naše stranke:

14-dnevna politika vračila v skladu z evropsko zakonodajo o varstvu potrošnikov
Najvišja ocena na Trustpilot
Dodaj na svoj seznam želja iMusic

Not rated yet

Na voljo tudi kot:

This book provides a framework for the design of competent optimization techniques by combining advanced evolutionary algorithms with state-of-the-art machine learning techniques. The primary focus of the book is on two algorithms that replace traditional variation operators of evolutionary algorithms, by learning and sampling Bayesian networks: the Bayesian optimization algorithm (BOA) and the hierarchical BOA (hBOA). They provide a scalable solution to a broad class of problems. The book provides an overview of evolutionary algorithms that use probabilistic models to guide their search, motivates and describes BOA and hBOA in a way accessible to a wide audience, and presents numerous results confirming that they are revolutionary approaches to black-box optimization.

186 pages, biography

Medij Knjige     Paperback Book   (Knjiga z mehkimi platnicami in lepljenim hrbtom)
Izdano 21. oktobra 2010
ISBN13 9783642062735
Založniki Springer-Verlag Berlin and Heidelberg Gm
Strani 186
Dimenzije 156 × 234 × 10 mm   ·   267 g
Jezik Angleščina  

Več od Martin Pelikan

Prikaži vse

Več od istega **izdajatelja**

Ogled vseh Martin Pelikan ( Na primer Hardcover Book in Paperback Book )