Search in Artificial Intelligence

Leveen Kanal (Curatore)

Vipin Kumar (Curatore)

Springer-Verlag New York Inc., 2011

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.

• Curatore: Leveen Kanal, Vipin Kumar
• Editore: Springer-Verlag New York Inc.
• Collana: Symbolic Computation
• Anno: 2011
• Rilegatura: Paperback / softback
• Pagine: 482 p.
• Dimensioni: 235 x 155 mm
• EAN: 9781461387909

Testo in English