Book by None
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
GRATIS gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoLibrería: Better World Books, Mishawaka, IN, Estados Unidos de America
Condición: Good. 1st Edition. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Nº de ref. del artículo: 4110914-6
Cantidad disponible: 1 disponibles
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
Condición: As New. 1st Edition. Used book that is in almost brand-new condition. Nº de ref. del artículo: 51187438-6
Cantidad disponible: 1 disponibles
Librería: Anybook.com, Lincoln, Reino Unido
Condición: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,950grams, ISBN:0387967508. Nº de ref. del artículo: 9857222
Cantidad disponible: 1 disponibles
Librería: NEPO UG, Rüsselsheim am Main, Alemania
Condición: Gut. Auflage: 1988. 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. Nº de ref. del artículo: 366474
Cantidad disponible: 1 disponibles