381. DeJong G. and Mooney R. (1986) Explanation-based learning: An alternative view. MachineLearning, 1, p. 145-176.

382. Dempster A. P. (1968) A generalization of Bayesian inference. Journal of the Royal Statistical Society,30 (Series B), p. 205-247.

383. Dempster A. P., Laird N., and Rubin D. (1977) Maximum likelihood from incomplete data via theEM algorithm. Journal of the Royal Statistical Society, 39 (Series B), p. 1-38.

384. Denes P. (1959) The design and operation of the mechanical speech recognizer at University CollegeLondon. Journal of the British Institution of Radio Engineers, 19(4), p. 219—234.

385. Deng X. and Papadimitriou С. Н. (1990) Exploring an unknown graph. In Proceedings 31st AnnualSymposium on Foundations of Computer Science, p. 355-361, St. Louis. IEEE Computer Society Press.

386. Denis F. (2001) Learning regular languages from simple positive examples. Machine Learning,44(1/2), p. 37-66.

387. Dennett D. С (1971) Intentional systems. The Journal of Philosophy, 68(4), p. 87-106.

388. Dennett D. C. (1978) Why you can't make a computer that feels pain. Synthese, 38(3).

389. Dennett D. С (1984) Cognitive wheels: the frame problem of AI. In Hookway С (Ed.), Minds,Machines, and Evolution: Philosophical Studies, p. 129-151. Cambridge University Press, Cambridge, UK.

390. Deo N. and Pang C.-Y. (1984) Shortest path algorithms: Taxonomy and annotation. Networks, 14(2),p. 275-323.

391. Descartes R. (1637) Discourse on method. In Cottingham J., StoothofTR., and Murdoch D. (Eds.),The Philosophical Writings of Descartes, Vol. I. Cambridge University Press, Cambridge, UK.

392. Descotte Y. and Latombe J.-C. (1985) Making compromises among antagonist constraints in aplanner. Artificial Intelligence, 27, p. 183-217.

393. Devroye L. (1987) A course in density estimation. Birkhauser, Boston.

394. Devroye L., Gyorfi L., and Lugosi G. (1996) A probabilistic theory of pattern recognition. Springer-Verlag, Berlin.

395. Dickmanns E. D. and Zapp A. (1987) Autonomous high speed road vehicle guidance by computervision. In Isermann R. (Ed.), Automatic Control — World Congress, 1987: Selected Papers from the 10th Triennial World Congress of the International Federation of Automatic Control, p. 221—226, Munich. Pergamon.

396. Dietterich T. (1990) Machine learning. Annual Review of Computer Science, 4, p. 255—306.

397. Dietterich T. (2000) Hierarchical reinforcement learning with the MAXQ value functiondecomposition. Journal of Artificial Intelligence Research, 13, p. 227-303.

398. DiGioia A. M., Kanade Т., and Wells P. (1996) Final report of the second international workshop onrobotics and computer assisted medical interventions. Computer Aided Surgery, 2, p. 69—101.

399. Dijkstra E. W. (1959) A note on two problems in connexion with graphs. Numerische Mathematik, 1,p. 269-271.

400. Dissanayake G., Newman P., Clark S., Durrant-Whyte H., and Csorba M. (2001) A solution to thesimultaneous localisation and map building (SLAM) problem. IEEE Transactions of Robotics and Automation, 17(3), p. 229-241.