Heuristics: Intelligent Search Strategies for Computer Problem SolvingAddison-Wesley Publishing Company, 1984 - 382 páginas Problem-solving strartegies and the nature of Heuristic informatio n.Heuristics and problem representations. Basic Heuristic-Search procedures. Formal properties of Heuristic methods. Heuristics viewed as information provided by simplified models. Performance analysis of Heuristic methods. Abstract models for quantitative performace analysis. Complexity versus precision of admissible Heuristics. Searching with nonadmissible Heuristics. Game-playing programs. Strategies and models for game-playing programs. Performace analysis for game-searching strategies. Decision quality in game searching. Bibliography. Index. |
Índice
PART I | 1 |
Basic HeuristicSearch Procedures | 33 |
Formal Properties of Heuristic Methods | 73 |
Página de créditos | |
Otras 10 secciones no se muestran.
Otras ediciones - Ver todo
Heuristics: Intelligent Search Strategies for Computer Problem Solving Judea Pearl Vista de fragmentos - 1984 |
Términos y frases comunes
8-Puzzle admissible admissible heuristic analysis AND/OR graphs Artificial Intelligence assume asymptotic backtracking best-first best-first search branching factor branching process breadth-first breadth-first search candidate Chapter Coin problem complexity computational condition cost depth-first search distribution error estimate evaluation function example expected number explored exponential game tree game-searching given goal node guaranteed h₁ h₂ heuristic function labeled leaf nodes Lemma MAX node minimax value move node on OPEN nodes expanded number of nodes number of terminal obtained OPEN node optimal solution P₁ parameters Pearl performance player pointers probabilistic probability procedure Proof pruning pruning algorithm random variables recursive represent satisfied SCOUT search strategies Section solution graph solution path solution tree SOLVE static evaluation subproblem subset subtree successors terminal nodes terminal values Theorem tion Traveling Salesman problem whereas