101. Berger J. O. (1985) Statistical Decision Theory and bayesian Analysis. Springer Verlag, Berlin.

102. Berlekamp E. R., Conway J. H., and Guy R. K. (1982) Winning Ways, For Your Mathematical Plays.Academic Press, New York.

103. Berleur J. and Brunnstein K. (2001) Ethics of Computing: Codes, Spaces for Discussion and Law.Chapman and Hall, London.

104. Berliner H. J. (1977) BKG — a program that plays backgammon. Tech. rep., Computer ScienceDepartment, Carnegie-Mellon University, Pittsburgh.

105. Berliner H. J. (1979) The B* tree search algorithm: A best-first proof procedure. Artificial Intelligence,72(1), p. 23-40.

106. Berliner H. J. (1980a) Backgammon computer program beats world champion. Artificial Intelligence,14, p. 205-220.

107. Berliner H. J. (1980b) Computer backgammon. Scientific American, 249(6), p. 64-72.

108. Berliner H. J. and Ebeling C. (1989) Pattern knowledge and search: The SUPREM architecture.Artificial Intelligence, 38(2), p. 161-198.

109. Bernardo J. M. and Smith A. F. M. (1994) Bayesian Theory. Wiley, New York.

110. Berners-Lee Т., Hendler J., and Lassila O. (2001) The semantic web. Scientific American, 284(5),p. 34-43.

111. Bernoulli D. (1738) Specimen theoriae novae de mensura sortis. Proceedings of the St. PetersburgImperial Academy of Sciences, 5, p. 175-192.

112. Bernstein A. and Roberts M. (1958) Computer vs. chess player. Scientific American, 198(6), p. 96-105.

113. Bernstein A., Roberts M., Arbuckle Т., and Belsky M. S. (1958) A chess playing program for the IBM704. In Proceedings of the 1958 Western Joint Computer Conference, p. 157-159, Los Angeles. American Institute of Electrical Engineers.

114. Bernstein P. L. (1996) Against the Odds: The Remarkable Story of Risk. Wiley, New York.

115. Berrou C, Glavieux A., and Thitimajshima P. (1993) Near Shannon limit error control-correctingcoding and decoding: Turbo-codes. 1. In Proc. IEEE International Conference on Communications, p. 1064-1070, Geneva, Switzerland. IEEE.

116. Berry D. A. and Fristedt B. (1985) Bandit Problems: Sequential Allocation of Experiments. Chapmanand Hall, London.

117. Bertele U. and Brioschi F. (1972) Nonserial dynamic programming. Academic Press, New York.

118. Bertoli P., Cimatti A., and Roveri M. (2001a) Heuristic search + symbolic model checking = efficientconformant planning. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), p. 467-472, Seattle. Morgan Kaufmann.

119. Bertoli P., Cimatti A., Roveri M., and Traverso P. (2001b) Planning in nondeterministic domainsunder partial observability via symbolic model checking. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), p. 473-478, Seattle. Morgan Kaufmann.

120. Bertsekas D. (1987) Dynamic Programming: Deterministic and Stochastic Models. Prentice-Hall, UpperSaddle River, New Jersey.