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 79
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
A.I. programs algorithm answer applied approach appropriate arcs ARMEMPTY backtracking best-first search blocks world branching factor breadth-first search Caesar Chapter chess clauses CLEAR(A complete concept conceptual dependency consider constraint contains database described discussed domain example expert systems exploit explore fact frame game tree given grammar graph heuristic function important input INTERLISP ISA links John knowledge representation labelings learning LISP Marcus match minimax move MTRANS MYCIN node objects ON(B operators parsing particular path performed possible preconditions predicate logic probabilistic problem problem-solving produce production systems PROLOG propositional logic question reasoning representing knowledge resolution rules satisfied script search procedure search process Section semantic net semantic nets sentence shown in Figure simple situation slots solution solve specific statements step strategy structure successors Suppose syntactic task techniques theorem things tion tree true understanding UNSTACK variable variety vertex