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 3
Página 218
... tournament . Adding this to the dependency network first illustrates the fact that nodes can have more than one justification as shown in Figure 7.11 . Not only does Cabot say he was at the ski slopes , but he was seen there on ...
... tournament . Adding this to the dependency network first illustrates the fact that nodes can have more than one justification as shown in Figure 7.11 . Not only does Cabot say he was at the ski slopes , but he was seen there on ...
Página 325
... tournaments are held regularly . Computers are not permitted to compete in these tournaments , but it is believed that the best programs are stronger than the best humans . High - performance Othello programs rely on fast brute - force ...
... tournaments are held regularly . Computers are not permitted to compete in these tournaments , but it is believed that the best programs are stronger than the best humans . High - performance Othello programs rely on fast brute - force ...
Página 582
... tournament One to state categorically that lightbulb changing is " no longer considered AI " The Psychological Group ( 5 ) One to build an apparatus which will time lightbulb - changing performance One to gather and run subjects One to ...
... tournament One to state categorically that lightbulb changing is " no longer considered AI " The Psychological Group ( 5 ) One to build an apparatus which will time lightbulb - changing performance One to gather and run subjects One to ...
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