Search in artificial intelligence

Front Cover
Springer-Verlag, 1988 - Computers - 482 pages
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.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


An Algebra for Search Problems and Their Solutions
A General BranchandBound Formulation
AverageCase Analysis of Heuristic Search

9 other sections not shown

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information