Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 6-10 of 44
Page 419
... called maximum likelihood estimate ) ; that is , for which j is Pr ( FV ) the largest ? Since in the above Pr ( V ) does not depend on j , we have only to calcuate for which jis Pr ( F1 ) · Pr ( VF ; ) = 6 ; Pr ( V | F ; ) the largest ...
... called maximum likelihood estimate ) ; that is , for which j is Pr ( FV ) the largest ? Since in the above Pr ( V ) does not depend on j , we have only to calcuate for which jis Pr ( F1 ) · Pr ( VF ; ) = 6 ; Pr ( V | F ; ) the largest ...
Page 420
... called " demons . ” Each unit is set to detect certain patterns in the activity of others and the output of each unit announces the degree of confidence of that unit that it sees what it is looking for . Our E ; units are Selfridge's ...
... called " demons . ” Each unit is set to detect certain patterns in the activity of others and the output of each unit announces the degree of confidence of that unit that it sees what it is looking for . Our E ; units are Selfridge's ...
Page 425
... called the basic learning heuristic - first try using methods similar to those which have worked , in the past , on similar problems . We want our machines , too , to benefit from their past experience . Since we cannot expect new ...
... called the basic learning heuristic - first try using methods similar to those which have worked , in the past , on similar problems . We want our machines , too , to benefit from their past experience . Since we cannot expect new ...
Page 433
... called ( Sec . IC ) the " Mesa phenomena . " In changing just one instruction at a time the machine had not taken large enough steps in its search through program space . The second paper goes on to discuss a sequence of modifications ...
... called ( Sec . IC ) the " Mesa phenomena . " In changing just one instruction at a time the machine had not taken large enough steps in its search through program space . The second paper goes on to discuss a sequence of modifications ...
Page 435
... called " LT " below , was a first attempt to prove theorems in logic , by frankly heuristic methods . Although the program was not by human standards a brilliant success ( and did not surpass its designers ) , it stands as a landmark ...
... called " LT " below , was a first attempt to prove theorems in logic , by frankly heuristic methods . Although the program was not by human standards a brilliant success ( and did not surpass its designers ) , it stands as a landmark ...
Other editions - View all
Common terms and phrases
algorithms Allen Newell analysis applications areas Artificial Intelligence automated base basic behavior Chart chess complex computer science concepts Conf construction DENDRAL domain element engineering example experience Feigenbaum Feldman Figure function GAME generate-and-test goal H. A. Simon heuristic programming heuristic search human hypotheses ill-structured problems inference Information Processing input intelligence and robotics INTERLISP knowledge logic Logic Theorist machine intelligence manipulators mathematical mechanisms Memo memory methods Michie Minsky mission operations MYCIN NASA NASA's Natural Language Newell ORGANISM-1 Papers 3d Intl pattern recognition performance problem solving problem space problem statement Proc procedure Project Project MAC PSYC psychology representation rover rules Semantic sensors sequence Simon simplex method Slagle solution solver spacecraft Stanford Research Institute Stanford Univ structure Study Group symbolic task Tech techniques TEIRESIAS teleoperator theorem proving theory tion variables York