Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 11-15 of 32
Page 421
... position normalization ( unless sample figures have been presented previously in essentially all sizes and positions ) . For the chances are extremely small of finding , by random methods , enough properties usefully correlated with ...
... position normalization ( unless sample figures have been presented previously in essentially all sizes and positions ) . For the chances are extremely small of finding , by random methods , enough properties usefully correlated with ...
Page 422
... position - invariant . A general review of Doyle's work and other pattern - recognition experi- ments will be found in Selfridge and Neisser ( 1960 ) . For the complex discrimination , e.g. , between one and two connected objects , the ...
... position - invariant . A general review of Doyle's work and other pattern - recognition experi- ments will be found in Selfridge and Neisser ( 1960 ) . For the complex discrimination , e.g. , between one and two connected objects , the ...
Page 430
... positions , won , lost , or drawn . But in practice the full exploration of the resulting colossal " move tree " is ... position - this requires some heuristics for selection of " plausible moves . " Now , if the backing - up technique ...
... positions , won , lost , or drawn . But in practice the full exploration of the resulting colossal " move tree " is ... position - this requires some heuristics for selection of " plausible moves . " Now , if the backing - up technique ...
Page 431
... position in a board game , radiate three branches , representing the player's proposed moves . Each of these might be countered by a variety of opponent moves , and so on . According to some program , a finite tree is generated . Then ...
... position in a board game , radiate three branches , representing the player's proposed moves . Each of these might be countered by a variety of opponent moves , and so on . According to some program , a finite tree is generated . Then ...
Page 432
... position and what it predicts on the basis of an extensive con- tinuation exploration , i.e. , backing up . The sign of this error , " Delta , " is used for reinforcement ; thus the system may learn something at each move , 19 D. The ...
... position and what it predicts on the basis of an extensive con- tinuation exploration , i.e. , backing up . The sign of this error , " Delta , " is used for reinforcement ; thus the system may learn something at each move , 19 D. The ...
Other editions - View all
Common terms and phrases
algorithms Allen Newell analysis applications areas Artificial Intelligence automated basic behavior capabilities centers chess complex computer science computer systems concept Conf construction cost DENDRAL devices discussion domain elements engineering environment example existing experience exploration Feigenbaum Figure functions GAME goal hardware heuristic programming heuristic search human hypotheses ill-structured problems inference information processing input intelligence and robotics interaction knowledge logic machine intelligence man-machine systems manipulators Marvin Minsky mathematical mechanisms memory ment methods Minsky mission operations MYCIN NASA NASA's Natural Language Newell Papers 3d Intl pattern recognition performance planetary planning problem solving problem space problem statement Proc procedure processor Project Project MAC PSYC psychology representation rover rules sensors sequence Simon simplex method solution solver space missions spacecraft specific Stanford Research Institute Stanford Univ structure Study Group subproblems symbolic task Tech techniques TEIRESIAS teleoperator theory tion