1581. Wesley M. A. and Lozano-Perez T. (1979) An algorithm for planning collision-free paths amongpolyhedral objects. Communications of the ACM, 22(10), p. 560-570.

1582. Wheatstone C. (1838) On some remarkable, and hitherto unresolved, phenomena of binocular vision.Philosophical Transactions of the Royal Society of London, 2, p. 371—394.

1583. Whitehead A. N. (1911) An Introduction to Mathematics. Williams and Northgate, London.

1584. Whitehead A. N. and Russell B. (1910) Principia Mathematica. Cambridge University Press,Cambridge, UK.

1585. Whorf B. (1956) Language, Thought, and Reality. MIT Press, Cambridge, Massachusetts.

1586. Widrow B. (1962) Generalization and information storage in networks of adaline "neurons". InYovits M. C, Jacobi G. Т., and Goldstein G. D. (Eds.) Self-Organizing Systems 1962, p. 435-461, Chicago, Illinois. Spartan.

1587. Widrow B. and HofT M. E. (1960) Adaptive switching circuits. In 1960 IRE WESCON ConventionRecord, p. 96-104, New York.

1588. Wiener N. (1942) The extrapolation, interpolation, and smoothing of stationary time series.Osrd370, Report to the Services 19, Research Project DIC-6037, MIT, Cambridge, Massachusetts.

1589. Wiener N. (1948) Cybernetics. Wiley, New York.

1590. Wilensky R. (1978) Understanding goal-based stories. Ph.D. thesis, Yale University, New Haven,Connecticut.

1591. Wilensky R. (1983) Planning and Understanding. Addison-Wesley, Reading, Massachusetts.

1592. Wilkins D. E. (1980) Using patterns and plans in chess. Artificial Intelligence, 14(2), p. 165-203.

1593. Wilkins D. E. (1988) Practical Planning: Extending the AI Planning Paradigm. Morgan Kaufmann,San Mateo, California.

1594. Wilkins D. E. (1990) Can AI planners solve practical problems? Computational Intelligence, 6(4),p. 232-246.

1595. Wilkins D. E., Myers K. L., Lowrance J. D., and Wesley L. P. (1995) Planning and reacting in uncertain anddynamic environments. Journal of Experimental and Theoretical AI, 7(1), p. 197-227.

1596. Wilks Y (1975) An intelligent analyzer and understander of English. Communications of the ACM,18(5), p. 264-274.

1597. Williams R. J. (1992) Simple statistical gradient-following algorithms for connectionist reinforcementlearning. Machine Learning, 8, p. 229—256.

1598. Williams R. J. and Baird L. C. I. (1993) Tight performance bounds on greedy policies based onimperfect value functions. Tech. rep. NU-CCS-93-14, College of Computer Science, Northeastern University, Boston.

1599. Wilson R. A. and Keil F. С (Eds.) (1999) The MIT Encyclopedia of the Cognitive Sciences. MIT Press,Cambridge, Massachusetts.

1600. Winograd S. and Cowan J. D. (1963) Reliable Computation in the Presence of Noise. MIT Press,Cambridge, Massachusetts.