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 7
Página 325
... computer checkers began with Samuel [ 1963 ] . Samuel's program had an inter- esting learning component which ... Go Go is a very difficult game to play by machine since the average branching factor of the game tree is very high . Brute ...
... computer checkers began with Samuel [ 1963 ] . Samuel's program had an inter- esting learning component which ... Go Go is a very difficult game to play by machine since the average branching factor of the game tree is very high . Brute ...
Página 359
... go to New York as soon as possible , " the system will have " understood ... Computer under- standing has so far been applied primarily to images ... computer . Bill A Mary Bill Mary / R Bill MTRANS Bill 359 Understanding What Is ...
... go to New York as soon as possible , " the system will have " understood ... Computer under- standing has so far been applied primarily to images ... computer . Bill A Mary Bill Mary / R Bill MTRANS Bill 359 Understanding What Is ...
Página 602
... Computer Go . In Computer Games , ed . D. N. L. Levy . New York : Springer- Verlag . Wilensky , R. 1981. PAM . In Inside Computer Understanding , ed . R. C. Schank and C. K. Riesbeck . Hillsdale , NJ : Erlbaum . Wilensky , R. 1986 ...
... Computer Go . In Computer Games , ed . D. N. L. Levy . New York : Springer- Verlag . Wilensky , R. 1981. PAM . In Inside Computer Understanding , ed . R. C. Schank and C. K. Riesbeck . Hillsdale , NJ : Erlbaum . Wilensky , R. 1986 ...
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