Search in artificial intelligence

Front Cover
Springer-Verlag, 1988 - Computers - 482 pages
0 Reviews
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.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Related books


An Algebra for Search Problems and Their Solutions
A General BranchandBound Formulation
AverageCase Analysis of Heuristic Search

9 other sections not shown

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

References from web pages

Search in Artificial Intelligence
Search in Artificial Intelligence. Ed. by Laveen Kanal and Vipin Kumar. Springer-Verlag, New York, 1988. Pp. 482, hardcover, $53.00, ISBN 0-387-96750-8. ... ft_gateway.cfm?id=1063892& type=pdf

Blackwell Publishing Ltd Oxford, UK COIN Computational ...
In Search in artificial intelligence . Edited by L. Kanal and V. Kumar . Springer-Verlag , New York , NY . pp. 426 – 449 . Nadel , ba 1986 . ... doi/ xml/ 10.1111/ j.1467-8640.1989.tb00328.x

Ten Project Proposals in Artificial Intelligence
Search in artificial intelligence,. Springer-Verlag (1988). [5]. Søgealgoritmer, makrooperatorer og kvadratspil,. RUC-rapport, Datalogi, modul 1 (1997/98). ... ~keld/ teaching/ Projektforslag/ AI_Projects.pdf

ingentaconnect On the asymptotic performance of IDA*
1) The analysis of asymptotic optimality for IDA* in [re Korf, Optimal path finding algorithms, in: Search in Artificial Intelligence, eds. ... content/ klu/ amai/ 1997/ 00000020/ F0040001/ 00325428;jsessionid=8zq3vu9vb2jn.alice?format=print

sciencedirect - Engineering Applications of Artificial ...
Freuder, 1988 E. Freuder, Backtrack-free and backtrack-bounded search In: L. Kanal and V. Kumar, Editors, Search in Artificial Intelligence, Springer, ... retrieve/ pii/ S0952197604000831

.bp .po 1i .ps 9 .nr pp 9 .he '%''Vipin Kumar' .fo '\*(td''' .(lc ...
... Vipin Kumar, and Christian B. Suttner, North-Holland, July 1994. .ip [\n+J] Search in Artificial Intelligence, edited by Laveen Kanal and Vipin Kumar, ... ~kumar/ publist

A bibliography of heuristic search research through 1992 - Systems ...
in Search in Artificial Intelligence, Kanal and Kumar, eds. New York:. Springer-Verlag, pp. 268-286; 1988. [55] ja Bamett, “How much is control knowledge ... iel1/ 21/ 6967/ 00281425.pdf

Parallel search algorithms for discrete optimization problems
Search in Artificial Intelligence. Springer-Verlag, New York, 1988. [28] Vipin Kumar, K. Ramesh, and V. Nageshwara Ro. Parallel best-first search of state- ... index/ k555k82u54151815.pdf

Algorithms for Constraint- Satisfaction Problems: A Survey
In Search in Artificial Intelligence,. eds. L. Kanal and V. Kumar, 343–369. New York:. Springer-Verlag. Freuder, E. 1982. A Sufficient Condition for Back- ... ~hzhang/ c145/ vipin.pdf

Bibliography. Aarup, M., Arentoft, mm, Parrod, Y., Stader, J.,. and Stokes, I. (1994). OPTIMUM-AIV: A knowledge-. based planning and scheduling system for ... newchapbib.pdf

Bibliographic information