## Artificial IntelligenceThe breadth of A. I. is explored and explained in this best selling text. Assuming no prior knowledge,it covers topics like neural networks and robotics. This text explores the range of problems which have been and remain to be solved using A. I. tools and techniques. The second half of this text is an excellent reference. |

### Dentro del libro

Resultados 1-3 de 80

Página 50

Suppose the cities to be visited and the distances between them are as

path that might be followed is the one

miles ...

Suppose the cities to be visited and the distances between them are as

**shown in****Figure**2 . 14 . One place the salesman could start is Boston . In that case , onepath that might be followed is the one

**shown in Figure**2 . 15 , which is 8850miles ...

Página 85

Consider the example

step and that one of its successors is node E , producing the graph

described .

Consider the example

**shown in Figure**3 . ... that node J is expanded at the nextstep and that one of its successors is node E , producing the graph

**shown in****Figure**3 . ... There is one important limitation of the algorithm we have justdescribed .

Página 370

We use the conventions

illustrate these labelings , Figure 14 . 13 shows the drawing of Figure 14 . 9 with

each of its lines correctly labeled . Assuming these four line types , we can

calculate ...

We use the conventions

**shown in Figure**14 . 12 to show line labelings . Toillustrate these labelings , Figure 14 . 13 shows the drawing of Figure 14 . 9 with

each of its lines correctly labeled . Assuming these four line types , we can

calculate ...

### Comentarios de la gente - Escribir un comentario

No encontramos ningún comentario en los lugares habituales.

### Contenido

8 | 231 |

Expert Systems | 233 |

Weak SlotandFiller Structures | 251 |

Derechos de autor | |

Otras 16 secciones no mostradas

### Otras ediciones - Ver todas

### Términos y frases comunes

actions active addition agents algorithm allow answer applied approach attributes becomes belief block build called Chapter choose combined complete concept consider constraints contains corresponding define dependency described discussed domain efficient elements example fact Figure frame function given goal heuristic important inheritance initial input instance interpretation John kinds knowledge knowledge base labeled language learning logic look match meaning methods move natural necessary node object occur operators output particular path perform position possible preconditions predicate problem procedure produce properties question reasoning relation represent representation result rules semantic sentence shown in Figure shows simple single situation slot solution solve space specific step stored structure Suppose task techniques things tree true understanding units weights