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
Description
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.
Item Description:Electronic resource.
Physical Description:1 online resource (x, 482 pages 67 illustrations)
ISBN:9781461387886 (electronic bk.)
1461387884 (electronic bk.)