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 21
Página 73
... branch is explored . But eventually , if a solution is not found , that branch will start to look less promising than one of the top - level branches that had been ignored . At that point , the now more promising , previously ignored branch ...
... branch is explored . But eventually , if a solution is not found , that branch will start to look less promising than one of the top - level branches that had been ignored . At that point , the now more promising , previously ignored branch ...
Página 212
... branch in the search space . If that branch eventually dies out , then we know that at least one guess that led to it must be wrong . It could be any guess along the branch . In chronological backtracking we have to assume it was the ...
... branch in the search space . If that branch eventually dies out , then we know that at least one guess that led to it must be wrong . It could be any guess along the branch . In chronological backtracking we have to assume it was the ...
Página 471
... branches , it is possible that one branch has no corresponding training instances . In that case , we can either leave the node unlabeled , or we can attempt to guess a label based on statistical properties of the set of instances being ...
... branches , it is possible that one branch has no corresponding training instances . In that case , we can either leave the node unlabeled , or we can attempt to guess a label based on statistical properties of the set of instances being ...
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