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 82
Página 35
... solve the problem , producing such a specification is itself a very hard problem . Although our ultimate goal is to be able to solve difficult , unstructured problems , such as natural language understanding , it is useful to explore ...
... solve the problem , producing such a specification is itself a very hard problem . Although our ultimate goal is to be able to solve difficult , unstructured problems , such as natural language understanding , it is useful to explore ...
Página 98
... solving techniques with knowledge to solve several important classes of problems . 3.8 Exercises 1. When would best - first search be worse than simple breadth - first search ? 2. Suppose we have a problem that we intend to solve using ...
... solving techniques with knowledge to solve several important classes of problems . 3.8 Exercises 1. When would best - first search be worse than simple breadth - first search ? 2. Suppose we have a problem that we intend to solve using ...
Página 448
... solve it . The next time we see the problem , we can solve it more efficiently . Moreover , we can generalize from our experience to solve related problems more easily . In contrast to advice taking , learning from problem - solving ...
... solve it . The next time we see the problem , we can solve it more efficiently . Moreover , we can generalize from our experience to solve related problems more easily . In contrast to advice taking , learning from problem - solving ...
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