This book is particularly concerned with heuristic state-space search for combinatorial optimization. Its two central themes are the average-case complexity of state-space search algorithms and the applications of the results notably to branch-and-bound techniques. Primarily written for researchers in computer science, the author presupposes a basic familiarity with complexity theory, and it is assumed that the reader is familiar with the basic concepts of random variables and recursive functions. Two successful applications are presented in depth: one is a set of state-space transformation methods which can be used to find approximate solutions quickly, and the second is forward estimation for constructing more informative evaluation functions.

Rese�a del editor:

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

Rob the Book Man
WA, U.S.A.

Gesch�ftsbedingungen:

We accept Mastercard, Visa, personal check or money order. If you are paying by
check send to Rob Briggs at 13016 NE 37th Court, Vancouver, WA 98686. If you
receive book that is not as described you may return it for a full refund. IF YOU
WOULD LIKE TO SEE MORE OF OUR BOOKS PLEASE CLICK ON "SEARCH THIS BOOKSELLERS
INVENTORY."
robthebookman@gmail.com
503-231-4091

Versandinformationen:

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. In particular, international shipping of large books may cost extra due to rapidly rising post shipping costs.

Zahlungsarten
akzeptiert von diesem Verk�ufer

Vorauskasse Money Order PayPal

Zu Kaufgesuchen hinzuf�gen

Verwandte Artikel zu State Space Search: Algorithms, Complexity, Extensions,...

State Space Search: Algorithms, Complexity, Extensions, and Applications

Zhang, Weixiong

Gebraucht - Hardcover

Unternehmensdaten des Verk�ufers