Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report |
From inside the book
Results 6-10 of 12
Page 274
... methods for restricted tasks . Consider a typical subroutine library , with its specific routines for inverting matrices , computing the sine , carrying out the simplex method , and so on . The only general " programs " are the higher ...
... methods for restricted tasks . Consider a typical subroutine library , with its specific routines for inverting matrices , computing the sine , carrying out the simplex method , and so on . The only general " programs " are the higher ...
Page 294
... methods , such as the simplex method . Thus generate - and - test specifies that you must have a generator and you must have a test ; then the procedure tells how to organize these . This feature seems to be related to the strength of the ...
... methods , such as the simplex method . Thus generate - and - test specifies that you must have a generator and you must have a test ; then the procedure tells how to organize these . This feature seems to be related to the strength of the ...
Page 296
... Simplex Method The simplex method clearly involves both optimization and search , hence should eventually show kinship with the methods that we have been describing . We should be able to construct a sequence of methods , each with ...
... Simplex Method The simplex method clearly involves both optimization and search , hence should eventually show kinship with the methods that we have been describing . We should be able to construct a sequence of methods , each with ...
Page 297
... simplex method Given : a set of n + m variables , { x } , where each x > 0 : let ĩ be the ( n + m ) -tuple ( xi , X2 , Xn + m ) ; Find : - · • a set of m constraints , { g = b — ax } : let the feasible region be { g an objective ...
... simplex method Given : a set of n + m variables , { x } , where each x > 0 : let ĩ be the ( n + m ) -tuple ( xi , X2 , Xn + m ) ; Find : - · • a set of m constraints , { g = b — ax } : let the feasible region be { g an objective ...
Page 298
... simplex procedure specified in Fig . 10.2 ( actually steps 2 , 3 , and 4 ) , which amounts to roughly m ( n + m ) multiplications ( to use a time - honored unit of computational ... method Given C - 37 The Continuity of Methods 397.
... simplex procedure specified in Fig . 10.2 ( actually steps 2 , 3 , and 4 ) , which amounts to roughly m ( n + m ) multiplications ( to use a time - honored unit of computational ... method Given C - 37 The Continuity of Methods 397.
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