Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 76
Página 366
... Figure 14.7 : A Speech Waveform 192 196 on what the basic constituents are . Figure 14.6 shows a simplified example from speech understanding . Assuming that the sounds shown in the figure have been identified , the problem is to group ...
... Figure 14.7 : A Speech Waveform 192 196 on what the basic constituents are . Figure 14.6 shows a simplified example from speech understanding . Assuming that the sounds shown in the figure have been identified , the problem is to group ...
Página 373
... Figure 14.17 : The Eighteen Physically Possible Trihedral Vertices not necessary to use the second part of our ... shown in Figure 14.18 ( a ) . We can begin by labeling all the boundary edges , as shown in Figure 14.18 ( b ) . Suppose ...
... Figure 14.17 : The Eighteen Physically Possible Trihedral Vertices not necessary to use the second part of our ... shown in Figure 14.18 ( a ) . We can begin by labeling all the boundary edges , as shown in Figure 14.18 ( b ) . Suppose ...
Página 489
... shown in Figure 18.1 . Processing elements , or units , are always in one of two states , active or inactive . In the figure , units colored black are active and units colored white are inactive . Units are connected to each other with ...
... shown in Figure 18.1 . Processing elements , or units , are always in one of two states , active or inactive . In the figure , units colored black are active and units colored white are inactive . Units are connected to each other with ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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