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 88
Página 8
... techniques that are appropriate for the solution of a variety of these problems ? The answer to this question is yes , there are . What , then , if anything , can we say about those techniques besides the fact that they manipulate ...
... techniques that are appropriate for the solution of a variety of these problems ? The answer to this question is yes , there are . What , then , if anything , can we say about those techniques besides the fact that they manipulate ...
Página 22
... techniques : • Search - Provides a way of solving problems for which no more direct approach is available as well as a framework into which any direct techniques that are available can be embedded . • Use of Knowledge - Provides a way ...
... techniques : • Search - Provides a way of solving problems for which no more direct approach is available as well as a framework into which any direct techniques that are available can be embedded . • Use of Knowledge - Provides a way ...
Página 63
... techniques ; rather they must be attacked by appropriate search methods armed with whatever direct techniques are available to guide the search . In this chapter , a framework for describing search methods is provided and several ...
... techniques ; rather they must be attacked by appropriate search methods armed with whatever direct techniques are available to guide the search . In this chapter , a framework for describing search methods is provided and several ...
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