501. Freund Y. and Schapire R. E. (1996) Experiments with a new boosting algorithm. In Proceedings of theThirteenth International Conference on Machine Learning, Bari, Italy. Morgan Kaufmann.

502. Friedberg R. M. (1958) A learning machine: Part I. IBM Journal, 2, p. 2-13.

503. Friedberg R. M., Dunham В., and North T. (1959) A learning machine: Part II. IBM Journal ofResearch and Development, 3(3), p. 282—287.

504. Friedman G. J. (1959) Digital simulation of an evolutionary process. General Systems Yearbook, 4,p. 171-184.

505. Friedman J., Hastie Т., and Tibshirani R. (2000) Additive logistic regression: A statistical view ofboosting. Annals of Statistics, 28(2), p. 337-374.

506. Friedman N. (1998) The Bayesian structural EM algorithm. In Uncertainty in Artificial Intelligence:Proceedings of the Fourteenth Conference, Madison, Wisconsin. Morgan Kaufmann.

507. Friedman N. and Goldszmidt M. (1996) Learning Bayesian networks with local structure. InUncertainty in Artificial Intelligence: Proceedings of the Twelfth Conference, p. 252-262, Portland, Oregon. Morgan Kaufmann.

508. Fry D. B. (1959) Theoretical aspects of mechanical speech recognition. Journal of the British Institutionof Radio Engineers, /9(4), p. 211-218.

509. Fuchs J. J., Gasquet A., Olalainty В., and Currie K. W. (1990) PlanERS-1: An expert planning systemfor generating spacecraft mission plans. In First International Conference on Expert Planning Systems, p. 70-75, Brighton, UK. Institute of Electrical Engineers.

510. Fudenberg D. and Tirole J. (1991) Game theory. MIT Press, Cambridge, Massachusetts.

511. Fukunaga A. S., Rabideau G., Chien S., and Yan D. (1997) ASPEN: A framework for automatedplanning and scheduling of spacecraft control and operations. In Proceedings of the International Symposium onAI, Robotics and Automation in Space, p. 181 — 187, Tokyo.

512. Fung R. and Chang К. С (1989) Weighting and integrating evidence for stochastic simulation inBayesian networks. In Proceedings of the Fifth Conference on Uncertainty in Artificial Intelligence (UAI-89), p. 209-220, Windsor, Ontario. Morgan Kaufmann.

513. Gaifman H. (1964) Concerning measures in first order calculi. IsraelJoumal of Mathematics, 2, p. 1-18.

514. Gallaire H. and Minker J. (Eds.) (1978) Logic and Databases. Plenum, New York.

515. Gallier J. H. (1986) Logic for Computer Science: Foundations of Automatic Theorem Proving. Harper andRow, New York.

516. Gallo G. and Pallottino S. (1988) Shortest path algorithms. Annals of Operations Research, 13, p. 3-79.

517. Gamba A., Gamberini L., Palmieri G., and Sanna R. (1961) Further experiments with PAPA. NuovoCimento Supplemento, 20(2), p. 221—231.

518. Garding J. (1992) Shape from texture for smooth curved surfaces in perspective projection. Journal ofMathematical Imaging and Vision, 2(4), p. 327—350.

519. Gardner M. (1968) Logic Machines, Diagrams and Boolean Algebra. Dover, New York.

520. Garey M. R. and Johnson D. S. (1979) Computers and Intractability. W. H. Freeman, New York.