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 25
... human player . The rating is based on the ratings of players whom the program can beat . Already programs have acquired chess ratings higher than the vast majority of human players . For other problem domains , a less precise measure of ...
... human player . The rating is based on the ratings of players whom the program can beat . Already programs have acquired chess ratings higher than the vast majority of human players . For other problem domains , a less precise measure of ...
Página 324
... human analyses of the problems . A chess player , whether human or machine , carries a numerical rating that tells how well it has performed in competition with other players . This rating lets us evaluate in an absolute sense the ...
... human analyses of the problems . A chess player , whether human or machine , carries a numerical rating that tells how well it has performed in competition with other players . This rating lets us evaluate in an absolute sense the ...
Página 325
... Human go players make up for their inability to search deeply by using a great deal of knowledge about the game . It is probable that go - playing programs must also be knowledge - based , since today's brute - force programs cannot ...
... Human go players make up for their inability to search deeply by using a great deal of knowledge about the game . It is probable that go - playing programs must also be knowledge - based , since today's brute - force programs cannot ...
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