An Introduction to Artificial Intelligence: Can Computers Think? |
From inside the book
Results 1-3 of 10
Page 14
... described in numerical terms . Some , but not all , of these can actually be measured . This modeling , as the activity is called , of course requires intimate knowledge of the field and a great deal of trial and error . No mathematical ...
... described in numerical terms . Some , but not all , of these can actually be measured . This modeling , as the activity is called , of course requires intimate knowledge of the field and a great deal of trial and error . No mathematical ...
Page 68
... described above involving the systematic tracing of effects will necessarily have to be repeated many times . Although the probability is very small that a complex stochastic system will react the same way two times in a row ...
... described above involving the systematic tracing of effects will necessarily have to be repeated many times . Although the probability is very small that a complex stochastic system will react the same way two times in a row ...
Page 94
... described by a point p in a state space S. Let T ( p ) be a transformation with the property that p1 = T ( p ) belongs to S whenever p is in S. We call the pair [ p , T ( p ) ] a process . More precisely , this is a particular ...
... described by a point p in a state space S. Let T ( p ) be a transformation with the property that p1 = T ( p ) belongs to S whenever p is in S. We call the pair [ p , T ( p ) ] a process . More precisely , this is a particular ...
Other editions - View all
Common terms and phrases
actual algorithm amount answer applications approach approximate average begin behavior Bellman called chapter classical complex concept Consequently consider considerable course deal decision process described determine device difficulty digital computer discussed distribution draw Dynamic Programming effect equation essential example exist expected experience fact feasible field FIGURE function give given hand human idea important intelligence interesting Introduction involved learning levels logic look machine mathematical mathematical theory mathematician means method minimize nature observe operation optimal original particular path patient perform play player possible precise present Press probability problem puzzles question reasonable rules simple simulation situations solve space stochastic stop storage structure success talk techniques tell theory things tion transformation uncertainty University unknown various wish York
References to this book
The Bellman Continuum: A Collection of the Works of Richard E. Bellman Richard Ernest Bellman,Robert S. Roth No preview available - 1986 |