Research Catalog

Title

Search in artificial intelligence / Laveen Kanal, Vipin Kumar, editors.

Publication

• New York : Springer-Verlag, [1988]
• ©1988

Items in the Library & Off-site

Details

Additional Authors

• Kanal, Laveen N.
• Kumar, Vipin, 1956-

Description

x, 482 pages : illustrations; 25 cm

Summary

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.

Series Statement

Symbolic computation. Artificial intelligence

Uniform Title

Symbolic computation. Artificial intelligence

Subject

• Artificial intelligence > Data processing
• Algorithms
• Information storage and retrieval systems
• Algorithms
• Information Systems
• algorithms

Bibliography (note)

• Includes bibliographies and index.

Contents

The CDP: A Unifying Formulation for Heuristic Search, Dynamic Programming, and Branch-and-Bound / V. Kumar and L. Kanal -- An Algebra for Search Problems and Their Solutions / P. Helman -- A General Branch-and-Bound Formulation for AND/OR Graph and Game Tree Search / V. Kumar, D.S. Nau and L. Kanal -- Average-Case Analysis of Heuristic Search in Tree-Like Networks / A. Bagchi and A.K. Sen -- The Optimality of A* / R. Dechter and J. Pearl -- Network Search Algorithms with Modifiable Heuristics / A. Mahanti and K. Ray -- Optimal Path Finding Algorithms / R. Korf -- Developments with GPS / R.B. Banerji and G.W. Ernst -- Tree Search and Arc Consistency in Constraint Satisfaction Algorithms / B. Nadel -- Backtrack-Free and Backtrack-Bounded Search / E. Freuder -- Network-Based Heuristics for Constraint-Satisfaction Problems / R. Dechter and J. Pearl -- Fundamental Properties of Networks of Constraints: A New Formulation / U. Montanari and R. Rossi -- Comparison of the MINIMAX and PRODUCT Back-Up Rules in a Variety of Games / P. Chi and D.S. Nau.

ISBN

• 0387967508
• 9780387967509
• 3540967508
• 9783540967507

LCCN

88012247

OCLC

• ocm17841390
• 17841390
• SCSB-9152338

Owning Institutions

Princeton University Library