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 44
Página 64
... four six - sided cubes , with each side of each cube painted one of four colors . A solution to the puzzle consists of an arrangement of the cubes in a row such that on all four sides of the row one block face of each color is showing ...
... four six - sided cubes , with each side of each cube painted one of four colors . A solution to the puzzle consists of an arrangement of the cubes in a row such that on all four sides of the row one block face of each color is showing ...
Página 196
... four as mere aids to choosing which of the four to drop . The strategy illustrated would seem in general to be a good one : di- vide and conquer . When a set of beliefs has accumulated to the point of contradiction , find the smallest ...
... four as mere aids to choosing which of the four to drop . The strategy illustrated would seem in general to be a good one : di- vide and conquer . When a set of beliefs has accumulated to the point of contradiction , find the smallest ...
Página 526
... four training examples . ) Modify your program to use the momentum factor α = 0.9 . Did adding momentum ... four random 8 - bit vectors to represent the platforms of four political parties . For each party , generate nine individuals who ...
... four training examples . ) Modify your program to use the momentum factor α = 0.9 . Did adding momentum ... four random 8 - bit vectors to represent the platforms of four political parties . For each party , generate nine individuals who ...
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