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 17
Página 167
... five facts listed above ? Do so if possible . Otherwise , add the facts you need and then construct the proofs . 6. Assume the following facts : • Steve only likes easy courses . • Science courses are hard . • All the courses in the ...
... five facts listed above ? Do so if possible . Otherwise , add the facts you need and then construct the proofs . 6. Assume the following facts : • Steve only likes easy courses . • Science courses are hard . • All the courses in the ...
Página 526
... five of the input - output pairs . These five will make up the " testing set " ; the other 31 will make up the " training set . " Create a backpropagation network with eight input units , eight hidden units , and eight output units ...
... five of the input - output pairs . These five will make up the " testing set " ; the other 31 will make up the " training set . " Create a backpropagation network with eight input units , eight hidden units , and eight output units ...
Página 566
... five major design issues in speech systems . These issues also provide dimensions along which systems can be compared with one another . • Speaker Dependence versus Speaker Independence - A speaker - independent sys- tem can listen to ...
... five major design issues in speech systems . These issues also provide dimensions along which systems can be compared with one another . • Speaker Dependence versus Speaker Independence - A speaker - independent sys- tem can listen to ...
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