Heuristic Search

Theory and Applications

Stefan Edelkamp, Stefan Schroedl

712 pages, parution le 04/08/2011

Ajouter à une liste

Indisponible

Résumé

Search has been vital to artificial intelligence from the very beginning as a core technique in problem solving. The authors present a thorough overview of heuristic search with a balance of discussion between theoretical analysis and efficient implementation and application to real-world problems. Current developments in search such as pattern databases and search with efficient use of external memory and parallel processing units on main boards and graphics cards are detailed.

Heuristic search as a problem solving tool is demonstrated in applications for puzzle solving, game playing, constraint satisfaction and machine learning. While no previous familiarity with heuristic search is necessary the reader should have a basic knowledge of algorithms, data structures, and calculus. Real-world case studies and chapter ending exercises help to create a full and realized picture of how search fits into the world of artificial intelligence and the one around us.

Provides real-world success stories and case studies for heuristic search algorithms
Includes many AI developments not yet covered in textbooks such as pattern databases, symbolic search, and parallel processing units

Sommaire

Heuristic Search Primer
Heuristic Search under Memory Constraints
Heuristic Search Under Time Constraints
Heuristic Search Variants
Heuristic Search Applications

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Morgan Kaufmann
Auteur(s)	Stefan Edelkamp, Stefan Schroedl
Parution	04/08/2011
Nb. de pages	712
Format	23 x 19
Couverture	Relié
Poids	1406g
Intérieur	Noir et Blanc
EAN13	9780123725127