1321. Russell S. J. (1985) The compleat guide to MRS. Report STAN-CS-85-1080, Computer ScienceDepartment, Stanford University.

1322. Russell S. J. (1986) A quantitative analysis of analogy by similarity. In Proceedings of the FifthNational Conference on Artificial Intelligence (AAAI-86), p. 284-288, Philadelphia. Morgan Kaufmann.

1323. Russell S. J. (1988) Tree-structured bias. In Proceedings of the Seventh National Conference onArtificial Intelligence (AAAI-88), Vol. 2, p. 641-645, St. Paul, Minnesota. Morgan Kaufmann.

1324. Russell S. J. (1992) Efficient memory-bounded search methods. In ECAI 92: 10th EuropeanConference on Artificial Intelligence Proceeding?, p. 1-5, Vienna. Wiley.

1325. Russell S. J. (1998) Learning agents for uncertain environments (extended abstract). In Proceedings ofthe Eleventh Annual ACM Workshop on Computational Learning Theory (COLT-98), p. 101-103, Madison, Wisconsin. ACM Press.

1326. Russell S. J., Binder J., Koller D., and Kanazawa K. (1995) Local learning in probabilistic networkswith hidden variables. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), p. 1146-52, Montreal. Morgan Kaufmann.

1327. Russell S. J. and Grosof B. (1987) A declarative approach to bias in concept learning. In Proceedingsof the Sixth National Conference on Artificial Intelligence (AAAI-87), Seattle. Morgan Kaufmann.

1328. Russell S. J. and Norvig P. (1995) Artificial Intelligence: A Modern Approach. Prentice-Hall, UpperSaddle River, New Jersey.

1329. Russell S. J. and Subramanian D. (1995) Provably bounded-optimal agents. Journal of ArtificialIntelligence Research, 3, p. 575—609.

1330. Russell S. J., Subramanian D., and Parr R. (1993) Provably bounded optimal agents. In Proceedingsof the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), p. 338-345, Chambery, France. Morgan Kaufmann.

1331. Russell S. J. and Wefald E. H. (1989) On optimal game-tree search using rational meta-reasoning. InProceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89), p. 334-340, Detroit. Morgan Kaufmann.

1332. Russell S. J. and Wefald E. H. (1991) Do the Right Thing: Studies in Limited Rationality. MIT Press,Cambridge, Massachusetts.

1333. Rustagi J. S. (1976) Variational Methods in Statistics. Academic Press, New York.

1334. Ryder J. L. (1971) Heuristic analysis of large trees as generated in the game of Go. Memo AIM-155,Stanford Artificial Intelligence Project, Computer Science Department, Stanford University, Stanford, California.

1335. Sabin D. and Freuder E. С (1994) Contradicting conventional wisdom in constraint satisfaction. In ECAI94:11th European Conference on Artificial Intelligence. Proceedings, p. 125-129, Amsterdam. Wiley.

1336. Sacerdoti E. D. (1974) Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5(2),p. 115-135.

1337. Sacerdoti E. D. (1975) The nonlinear nature of plans. In Proceedings of the Fourth International JointConference on Artificial Intelligence (IJCAI-75), p. 206-214, Tbilisi, Georgia. IJCAII.

1338. Sacerdoti E. D. (1977) A Structure for Plans and Behavior. Elsevier/North-Holland, Amsterdam,London, New York.

1339. Sacerdoti E. D., Fikes R. E., Reboh R., Sagalowicz D., Waldinger R., and Wilber В. М. (1976)QLISP— a language for the interactive development of complex systems. In Proceedings of the AFIPS National Computer Conference, p. 349—356.

1340. Sacks E. and Joskowicz L. (1993) Automated modeling and kinematic simulation of mechanisms.Computer Aided Design, 25(2), p. 106-118.