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 11
Página 179
Elaine Rich, Kevin Knight. • In which direction is the branching factor ( i.e. , the average number of nodes that can be reached directly from a single node ) greater ? We would like to proceed in the direction with the lower branching ...
Elaine Rich, Kevin Knight. • In which direction is the branching factor ( i.e. , the average number of nodes that can be reached directly from a single node ) greater ? We would like to proceed in the direction with the lower branching ...
Página 318
... branch . But both thresholds and values have been inverted . So if Pass - Thresh > = Use - Thresh , then return ... branching factor of the alpha - beta procedure , see Baudet [ 1978 ] and Pearl [ 1982 ] . The idea behind the alpha ...
... branch . But both thresholds and values have been inverted . So if Pass - Thresh > = Use - Thresh , then return ... branching factor of the alpha - beta procedure , see Baudet [ 1978 ] and Pearl [ 1982 ] . The idea behind the alpha ...
Página 614
... branch - and - bound 40 , 62 , 314 branching factor 179 breadth - first search 37 , 58 , 62 , 73 , 79 , 98 , 101 , 323 , 326 bridge 56 , 62 , 326 British Museum algorithm 64 brittleness 288,556 CADUCEUS 240 candidate elimination ...
... branch - and - bound 40 , 62 , 314 branching factor 179 breadth - first search 37 , 58 , 62 , 73 , 79 , 98 , 101 , 323 , 326 bridge 56 , 62 , 326 British Museum algorithm 64 brittleness 288,556 CADUCEUS 240 candidate elimination ...
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