Artificial Intelligence, Volumen1McGraw-Hill, 1983 - 436 páginas What is artificial intelligence?; Problem solving; Problems and problem spaces; Basic problem-solving methods; Game playing; Knowledge representation; Knowledge representation using predicate logic; Knowledge representation using other logics; Structured representation of knowledge; Advanced topics; Advanced problem-solving systems; Natural language understanding; Perception; Learning; Implementing A.lI. systems: languages and machines; Conclusion; References; Index. |
Dentro del libro
Resultados 1-3 de 78
Página 91
Elaine Rich. A third important way in which the algorithm for searching AND - OR graphs will differ from the A * algorithm is that it will operate on graphs that are guaranteed not to contain any cycles . We can make this guarantee ...
Elaine Rich. A third important way in which the algorithm for searching AND - OR graphs will differ from the A * algorithm is that it will operate on graphs that are guaranteed not to contain any cycles . We can make this guarantee ...
Página 104
... algorithm is found for one of them , then it can be applied to all of them . No one has proven that no such algorithm exists , but it seems that none does . For a good introduction to the area of com- putationally hard problems , see ...
... algorithm is found for one of them , then it can be applied to all of them . No one has proven that no such algorithm exists , but it seems that none does . For a good introduction to the area of com- putationally hard problems , see ...
Página 105
... algorithm very easily . We must add N cities to the tour . Adding each requires examining all the cities not yet added , which is , on the average , ( N − 1 ) / 2 . So the time required is proportional to N * ( N - 1 ) / 2 or simply N2 ...
... algorithm very easily . We must add N cities to the tour . Adding each requires examining all the cities not yet added , which is , on the average , ( N − 1 ) / 2 . So the time required is proportional to N * ( N - 1 ) / 2 or simply N2 ...
Otras ediciones - Ver todas
Términos y frases comunes
addition algorithm already answer appear applied approach appropriate Artificial Intelligence attempt better block called Chapter choose clauses combined complete concept consider contains corresponding dependency described discussed domain example exploit explore fact frame function given goal grammar graph heuristic important indicates initial input interpretation involved John kinds knowledge labelings language learning logic look machine Marcus match means methods move natural necessary node objects occur operators particular path patterns perform position possible predicate present problem procedure produce prove question reasoning representation represented result rules satisfied script selected semantic sentence shown in Figure shows simple single situation solution solve space specific stack statement step stored structure Suppose task techniques things tion tree true understanding variety