Search in Artificial Intelligence /

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...

Full description

Bibliographic Details
Main Author: Kanal, Laveen
Corporate Author: SpringerLink (Online service)
Other Authors: Kumar, Vipin
Format: eBook
Language:English
Published: New York, NY : Springer New York, 1988.
Series:Symbolic computation. Artificial intelligence.
Subjects:
Online Access:Connect to the full text of this electronic book
Table of Contents:
  • The CDP: A Unifying Formulation for Heuristic Search, Dynamic Programming, and Branch-and-Bound
  • An Algebra for Search Problems and Their Solutions
  • A General Branch-and-Bound Formulation for AND/OR Graph and Game Tree Search
  • Average-Case Analysis of Heuristic Search in Tree-Like Networks
  • The Optimality of A*
  • Network Search Algorithms with Modifiable Heuristics
  • Optimal Path Finding Algorithms
  • Developments with GPS
  • Tree Search and Arc Consistency in Constraint Satisfaction Algorithms
  • Backtrack-Free and Backtrack-Bounded Search
  • Network-Based Heuristics for Constraint-Satisfaction Problems
  • Fundamental Properties of Networks of Constraints: A New Formulation
  • Comparison of the MINIMAX and PRODUCT Back-Up Rules in a Variety of Games
  • Index.