Transport gratuit la punctele de livrare Pick Up peste 299 lei
Packeta 15 lei Easybox 20 lei Cargus 25 lei FAN 25 lei

Hierarchical Bayesian Optimization Algorithm

Limba englezăengleză
Carte Carte broșată
Carte Hierarchical Bayesian Optimization Algorithm Martin Pelikan
Codul Libristo: 01651546
Editura Springer, Berlin, noiembrie 2009
This book provides a framework for the design of competent optimization techniques by combining adva... Descrierea completă
? points 161 b
324 lei
În depozitul extern în cantități mici Expediem în 10-15 zile

30 de zile pentru retur bunuri


Ar putea de asemenea, să te intereseze


Pomalu s miminkem a s koněm v páteři Karpat Ondřej Kano Landa / Carte broșată
common.buy 38 lei
Počong aneb O pinoživosti lidské existence Tereza Semotamová / Carte broșată
common.buy 36 lei
Das Kapital. Bd.1 Karl Marx / Copertă tare
common.buy 304 lei
Computational Science - ICCS 2009 Gabrielle Allen / Carte broșată
common.buy 982 lei
Blackwell Companion to Religion in America Philip Goff / Copertă tare
common.buy 1.389 lei

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.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 book focuses 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). BOA and hBOA are theoretically and empirically shown to provide robust and scalable solution for broad classes of nearly decomposable and hierarchical problems. A theoretical model is developed that estimates the scalability and adequate parameter settings for BOA and hBOA. The performance of BOA and hBOA is analyzed on a number of artificial problems of bounded difficulty designed to test BOA and hBOA on the boundary of their design envelope. The algorithms are also extensively tested on two interesting classes of real-world problems: MAXSAT and Ising spin glasses with periodic boundary conditions in two and three dimensions. Experimental results validate the theoretical model and confirm that BOA and hBOA provide robust and scalable solution for nearly decomposable and hierarchical problems with only little problem-specific information.

Dăruiește această carte chiar astăzi
Este foarte ușor
1 Adaugă cartea în coș și selectează Livrează ca un cadou 2 Îți vom trimite un voucher în schimb 3 Cartea va ajunge direct la adresa destinatarului

Logare

Conectare la contul de utilizator Încă nu ai un cont Libristo? Crează acum!

 
obligatoriu
obligatoriu

Nu ai un cont? Beneficii cu contul Libristo!

Datorită contului Libristo, vei avea totul sub control.

Creare cont Libristo