Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 25
Página 67
... possible successor of the current state will be better than SUCC . ( b ) For each operator that applies to the ... moves . There is a trade - off between the time required to select a move ( usually longer for steepest - ascent hill climbing ) ...
... possible successor of the current state will be better than SUCC . ( b ) For each operator that applies to the ... moves . There is a trade - off between the time required to select a move ( usually longer for steepest - ascent hill climbing ) ...
Página 72
... possible moves . Instead , it may be useful to exploit some criterion involving the number of moves that have been tried since an improvement was found . Experiments that have been done with simulated annealing on a variety of problems ...
... possible moves . Instead , it may be useful to exploit some criterion involving the number of moves that have been tried since an improvement was found . Experiments that have been done with simulated annealing on a variety of problems ...
Página 308
... moves in the search space , each of which is then evaluated by the tester ... possible , even with a good plausible- move generator , to search until a ... positions by estimating how likely they are to 308 CHAPTER 12. GAME PLAYING.
... moves in the search space , each of which is then evaluated by the tester ... possible , even with a good plausible- move generator , to search until a ... positions by estimating how likely they are to 308 CHAPTER 12. GAME PLAYING.
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space