This book brings together some new insights and recent developments on the topics of search procedures in Artificial Intelligence and the relationships among search methods in Artificial Intelligence, Operations Research, and Engineering. The purpose of the book is to present these new insights and recent developments in a manner accessible to students and professionals in Computer Science, Engineering, Operations Research, and Applied Mathematics. The articles should provide the reader with a broad view of recent developments on search in AI and some of the relationships among branch and bound, heuristic search, and dynamic programming. New models for discrete optimization problems, new results on the average case of complexity of the well known A* algorithm, new results on the conditions under which A* is optimal over other search algorithms, use of different sources of knowledge in heuristic search, new results on the constraint satisfaction problem, and a result showing the minimax back up rule does not do as well as the product rule in some real games.
"synopsis" may belong to another edition of this title.
Seller: HPB-Red, Dallas, TX, U.S.A.
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_391062150
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Hardcover. 482 S. Ehem. Bibliotheksexemplar mit Bib.-Signatur und Stempel in GUTEM Zustand. Kaum Gebrauchsspuren. 3540967508 Sprache: Englisch Gewicht in Gramm: 550. Seller Inventory # 2143068
Quantity: 1 available
Seller: NEPO UG, Rüsselsheim am Main, Germany
Unbekannt. Condition: Gut. S. Sprache: Englisch Gewicht in Gramm: 845. Seller Inventory # 302921
Quantity: 1 available