Search in Artificial Intelligence (Symbolic Computation / Artificial Intelligence)

Kanal, Leveen and Vipin Kumar

ISBN 10: 0387967508 / ISBN 13: 9780387967509

Editore: Springer 13.07.1988., 1988

Riguardo questo articolo

482 Seiten Exemplar aus einer wissenchaftlichen Bibliothek Altersfreigabe FSK ab 0 Jahre Sprache: Englisch Gewicht in Gramm: 969 24,6 x 16,4 x 2,8 cm, Gebundene Ausgabe.

Codice articolo 366474

Dati bibliografici

• Titolo: Search in Artificial Intelligence (Symbolic Computation / Artificial Intelligence)
• Editore: Springer 13.07.1988.
• Data di pubblicazione: 1988
• Lingua: Inglese
• ISBN 10: 0387967508
• ISBN 13: 9780387967509
• Rilegatura: Rilegato
• Edizione: Auflage: 1988.
• Condizione: Gut
• Peso: 969 grammi
• Cataloghi dei venditori:
  • Alle Bücher

Descrizione articolo

Riassunto

Search is an important component of problem solving in artificial intelligence (AI) and, more generally, in computer science, engineering and operations research. Combinatorial optimization, decision analysis, game playing, learning, planning, pattern recognition, robotics and theorem proving are some of the areas in which search algbrithms playa key role. Less than a decade ago the conventional wisdom in artificial intelligence was that the best search algorithms had already been invented and the likelihood of finding new results in this area was very small. Since then many new insights and results have been obtained. For example, new algorithms for state space, AND/OR graph, and game tree search were discovered. Articles on new theoretical developments and experimental results on backtracking, heuristic search and constraint propaga­ tion were published. The relationships among various search and combinatorial algorithms in AI, Operations Research, and other fields were clarified. This volume brings together some of this recent work in a manner designed to be accessible to students and professionals interested in these new insights and developments.

Contenuti

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.