981. Marbach P. and Tsitsiklis J. N. (1998) Simulation-based optimization of Markov reward processes.Technical report LIDS-P-2411, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology.

982.  Marcus M. P., Santorini В., and Marcinkiewicz M. A. (1993) Building a large annotated corpus ofenglish: The penn treebank. Computational Linguistics, 19(2), p. 313-330.

983.  Markov A. A. (1913) An example of statistical investigation in the text of "Eugene Onegin" illustratingcoupling of "tests" in chains. Proceedings of the Academy of Sciences of St. Petersburg, 7.

984. Maron M. E. (1961) Automatic indexing: An experimental inquiry. Journal of the Association forComputing Machinery, 8(2>), p. 404-417.

985.  Maron M. E. and Kuhns J.-L. (1960) On relevance, probabilistic indexing and information retrieval.Communications of the ACM, 7, p. 219-244.

986. Marr D. (1982) Vision: A Computational Investigation into the Human Representation and Processing ofVisual Information. W. H. Freeman, New York.

987.  Marriott K. and Stuckey P. J. (1998) Programming with Constraints: An Introduction. MIT Press,Cambridge, Massachusetts.

988.  Marsland A. T. and Schaeffer J. (Eds.) (1990) Computers, Chess, and Cognition. Springer-Verlag,Berlin.

989.  Martelli A. and Montanari U. (1976) Unification in linear time and space: A structured presentation.Internal report В 76-16, Istituto di Elaborazione della Informazione, Pisa, Italy.

990.  Martelli A. and Montanari U. (1978) Optimizing decision trees through heuristically guided search.Communications of the Association for Computing Machinery, 21, p. 1025—1039.

991.  Marthi В., Pasula H., Russell S. J., and Peres Y. (2002) Decayed MCMC filtering. In Uncertainty inArtificial Intelligence: Proceedings of the Eighteenth Conference, p. 319-326, Edmonton, Alberta. Morgan Kaufmann.

992.  Martin J. H. (1990) A Computational Model of Metaphor Interpretation. Academic Press, New York.

993. Martin P. and Shmoys D. B. (1996) A new approach to computing optimal schedules for the job-shopscheduling problem. In Proceedings of the 5th International IPCO Conference, p. 389-403. Springer-Verlag.

994. Maslov S. Y. (1964) An inverse method for establishing deducibility in classical predicate calculus.Doklady Akademii nauk SSSR, 159, p. 17-20.

995. Maslov S. Y. (1967) An inverse method for establishing deducibility of nonprenex formulas of thepredicate calculus. Doklady Akademii nauk SSSR, 172, p. 22-25.

996.  Mason M. (1993) Kicking the sensing habit. AIMagazine, 14(1), p. 58-59.

997. Mason M. (2001) Mechanics of Robotic Manipulation. MIT Press.

998. Mason M. and Salisbury J. (1985) Robot hands and the mechanics of manipulation. MIT Press.

999.  Mataric M. J. (1997) Reinforcement learning in the multi-robot domain. Autonomous Robots, 4(1),p. 73-83.

1000. Mates B. (1953) Stoic Logic. University of California Press, Berkeley and Los Angeles.