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 13 de 5
Página 15
Text The input text stored simply as a long character string. Question The current
question also stored as a character string. The Algorithm To answer a question,
do the following: 1 . Compare each element of QuestionPatterns against the ...
Text The input text stored simply as a long character string. Question The current
question also stored as a character string. The Algorithm To answer a question,
do the following: 1 . Compare each element of QuestionPatterns against the ...
Página 386
The e denotes the empty string. Symbols that are further expanded by rules are
called nonterminal symbols. Symbols that correspond directly to strings that must
be found in an input sentence are called terminal symbols. Grammar formalisms
...
The e denotes the empty string. Symbols that are further expanded by rules are
called nonterminal symbols. Symbols that correspond directly to strings that must
be found in an input sentence are called terminal symbols. Grammar formalisms
...
Página 482
For example, given positive and negative examples of strings in some regular
language, can we efficiently induce the finite automaton that produces all and
only the strings in that language? The answer is no; an exponential number of ...
For example, given positive and negative examples of strings in some regular
language, can we efficiently induce the finite automaton that produces all and
only the strings in that language? The answer is no; an exponential number of ...
Comentarios de la gente  Escribir un comentario
Calificaciones de los usuarios
5 estrellas 
 
4 estrellas 
 
3 estrellas 
 
2 estrellas 
 
1 estrella 

Crítica de los usuarios  Marcar como inadecuado
very poor book for novice.Assumes u already know AI and the language is not at all user friendly.One has to read a sentence repeatedly to get a grasp and some times even then u don't understand.Go for other books much better than this
Crítica de los usuarios  Marcar como inadecuado
not soo good to go for novice
Contenido
What Is Artificial Intelligence?  3 
Problems Problem Spaces and Search  29 
Heuristic Search Techniques  63 
Derechos de autor  
Otras 21 secciones no mostradas
Otras ediciones  Ver todas
Términos y frases comunes
agents algorithm answer apply approach ARMEMPTY Artificial Intelligence assertions axioms backpropagation backtracking belief bestfirst search breadthfirst search called Chapter chess clauses complete concept conceptual dependency connectionist consider contains corresponding define depthfirst depthfirst search described discussed domain example expert systems fact game tree goal grammar graph heuristic function Hopfield networks important inference initial input instance interpretation justification knowledge base knowledge representation labeled learning Marcus match methods minimax move MYCIN natural language node nonmonotonic object ON(B operators output units parsing particular path perceptron perform possible preconditions predicate logic problem problemsolving procedure produce production system PROLOG propagation question reasoning represent result robot rules script Section semantic sentence shown in Figure simple slot solution solve specific step strategy structure Suppose syntactic task techniques theorem things tree truth maintenance system variables version space weights
Referencias a este libro
Humancomputer Interaction Alan Dix,Alan John Dix,Janet Finlay,Gregory D. Abowd,Russell Beale Sin vista previa disponible  2003 