Seller: Second Story Books, ABAA, Rockville, MD, U.S.A.
Hardcover. Octavo, xvi, 201 pages. In Good condition. Spine is silver with brown print. Boards in glossy illustrated paper. Light wear to spine caps, remains of small vendor label on rear. Text block has mark in red ink on bottom edge. Illustrated: b&w graphs, tables, charts. NOTE: Shelved in Netdesk Column G. 1379275. FP New Rockville Stock.
Published by Secaucus, New Jersey, U.S.A.: Springer Verlag, 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Language: English
Seller: Rob the Book Man, Vancouver, WA, U.S.A.
Hardcover. Condition: Very Good. hardcover in very good + condition. name on inside cover, otherwise clean.
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Seller: Basi6 International, Irving, TX, U.S.A.
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
US$ 116.06
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
US$ 116.44
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Chiron Media, Wallingford, United Kingdom
US$ 107.56
Convert currencyQuantity: 10 available
Add to basketPF. Condition: New.
Published by Springer 01.11.1999., 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Language: English
Seller: NEPO UG, Rüsselsheim am Main, Germany
US$ 105.08
Convert currencyQuantity: 1 available
Add to basketCondition: Sehr gut. Auflage: 1999. 201 Seiten ex Library Book / aus einer wissenschafltichen Bibliothek / Sprache: Englisch Gewicht in Gramm: 469 24,1 x 16,1 x 1,6 cm, Gebundene Ausgabe.
Seller: Buchpark, Trebbin, Germany
US$ 85.12
Convert currencyQuantity: 1 available
Add to basketCondition: Gut. Zustand: Gut | Seiten: 228 | Sprache: Englisch | Produktart: Bücher.
Seller: Buchpark, Trebbin, Germany
US$ 87.07
Convert currencyQuantity: 1 available
Add to basketCondition: Sehr gut. Zustand: Sehr gut | Seiten: 220 | Sprache: Englisch | Produktart: Bücher.
Seller: BennettBooksLtd, North Las Vegas, NV, U.S.A.
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 137.03
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 137.03
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Published by Springer New York, Springer New York, 2012
ISBN 10: 1461271835 ISBN 13: 9781461271833
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 131.41
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is about problem solving. Specifically, it is about heuristic state-space search under branch-and-bound framework for solving com binatorial optimization problems. The two central themes of this book are the average-case complexity of heuristic state-space search algorithms based on branch-and-bound, and their applications to developing new problem-solving methods and algorithms. Heuristic state-space search is one of the fundamental problem-solving techniques in Computer Science and Operations Research, and usually constitutes an important component of most intelligent problem-solving systems. The search algorithms considered in this book can be classified into the category of branch-and-bound. Branch-and-bound is a general problem-solving paradigm, and is one of the best techniques for optimally solving computation-intensive problems, such as scheduling and planning. The main search algorithms considered include best-first search, depth first branch-and-bound, iterative deepening, recursive best-first search, and space-bounded best-first search. Best-first search and depth-first branch-and-bound are very well known and have been used extensively in Computer Science and Operations Research. One important feature of depth-first branch-and-bound is that it only requires space this is linear in the maximal search depth, making it very often a favorable search algo rithm over best-first search in practice. Iterative deepening and recursive best-first search are the other two linear-space search algorithms. Iterative deepening is an important algorithm in Artificial Intelligence, and plays an irreplaceable role in building a real-time game-playing program.
Published by Springer New York, Springer US, 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 136.69
Convert currencyQuantity: 1 available
Add to basketBuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is about problem solving. Specifically, it is about heuristic state-space search under branch-and-bound framework for solving com binatorial optimization problems. The two central themes of this book are the average-case complexity of heuristic state-space search algorithms based on branch-and-bound, and their applications to developing new problem-solving methods and algorithms. Heuristic state-space search is one of the fundamental problem-solving techniques in Computer Science and Operations Research, and usually constitutes an important component of most intelligent problem-solving systems. The search algorithms considered in this book can be classified into the category of branch-and-bound. Branch-and-bound is a general problem-solving paradigm, and is one of the best techniques for optimally solving computation-intensive problems, such as scheduling and planning. The main search algorithms considered include best-first search, depth first branch-and-bound, iterative deepening, recursive best-first search, and space-bounded best-first search. Best-first search and depth-first branch-and-bound are very well known and have been used extensively in Computer Science and Operations Research. One important feature of depth-first branch-and-bound is that it only requires space this is linear in the maximal search depth, making it very often a favorable search algo rithm over best-first search in practice. Iterative deepening and recursive best-first search are the other two linear-space search algorithms. Iterative deepening is an important algorithm in Artificial Intelligence, and plays an irreplaceable role in building a real-time game-playing program.
Published by Springer-Verlag New York Inc, 2013
ISBN 10: 1461271835 ISBN 13: 9781461271833
Language: English
Seller: Revaluation Books, Exeter, United Kingdom
US$ 176.03
Convert currencyQuantity: 2 available
Add to basketPaperback. Condition: Brand New. 217 pages. 9.25x6.10x0.50 inches. In Stock.
Seller: dsmbooks, Liverpool, United Kingdom
US$ 181.25
Convert currencyQuantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
Published by Springer-Verlag New York Inc., 2012
ISBN 10: 1461271835 ISBN 13: 9781461271833
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
US$ 159.23
Convert currencyQuantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 348.
Published by Springer-Verlag New York Inc., 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
US$ 159.23
Convert currencyQuantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 528.