@article{10_21136_AM_1971_103354,
author = {Vajda, Igor},
title = {A discrete theory of search. {I}},
journal = {Applications of Mathematics},
pages = {241--255},
year = {1971},
volume = {16},
number = {4},
doi = {10.21136/AM.1971.103354},
mrnumber = {0294045},
zbl = {0231.62094},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1971.103354/}
}
Vajda, Igor. A discrete theory of search. I. Applications of Mathematics, Tome 16 (1971) no. 4, pp. 241-255. doi: 10.21136/AM.1971.103354
[1] I. Vajda: On random design of experiments. (in Russian). Information Transmission Problems 4 (1968), N. 4, 26-36. | MR
[2] A. Rényi: On the theory of random search. Bull. Amer. Math. Soc. 71 (1965), N. 1, 809-828. | DOI | MR
[3] J. Nedoma: Coding of finite sets of messages. Presented at 2nd Czechoslovak Conf. on Cybernetics, Prague 16.-19. XI. 1965.
[4] A. Feinstein: Foundations of Information Theory. McGraw Hill, N. Y. 1958. | MR | Zbl
[5] I. Vajda: Rate of convergence of the information in a sample concerning a parameter. Czechoslovak Math. Journal, 17 (1967), N. 2, 225-231. | MR | Zbl
[6] I. Vajda: On statistical decision problems with finite parameter space. Kybernetika 3 (1967), N. 5, 451-466. | MR
Cité par Sources :