Previous |  Up |  Next

Article

Title: A discrete theory of search. I (English)
Author: Vajda, Igor
Language: English
Journal: Aplikace matematiky
ISSN: 0373-6725
Volume: 16
Issue: 4
Year: 1971
Pages: 241-255
Summary lang: English
Summary lang: Czech
.
Category: math
.
Summary: In this paper an introduction to the theory of search, as developed in the previous papers of A. Rényi and the author, is given. Basic results of those papers are unified and summarized from a Bayesian point of view which is accepted throughout the paper. Some new results are established and a relation of the theory of search to the information theory is pointed out. ()
MSC: 60C05
MSC: 62L12
MSC: 90B40
MSC: 94A15
MSC: 94A24
idZBL: Zbl 0231.62094
idMR: MR0294045
DOI: 10.21136/AM.1971.103354
.
Date available: 2008-05-20T17:51:00Z
Last updated: 2020-07-28
Stable URL: http://hdl.handle.net/10338.dmlcz/103354
.
Reference: [1] I. Vajda: On random design of experiments.(in Russian). Information Transmission Problems 4 (1968), N. 4, 26-36. MR 0359208
Reference: [2] A. Rényi: On the theory of random search.Bull. Amer. Math. Soc. 71 (1965), N. 1, 809-828. MR 0186481, 10.1090/S0002-9904-1965-11402-1
Reference: [3] J. Nedoma: Coding of finite sets of messages.Presented at 2nd Czechoslovak Conf. on Cybernetics, Prague 16.-19. XI. 1965.
Reference: [4] A. Feinstein: Foundations of Information Theory.McGraw Hill, N. Y. 1958. Zbl 0082.34602, MR 0095087
Reference: [5] I. Vajda: Rate of convergence of the information in a sample concerning a parameter.Czechoslovak Math. Journal, 17 (1967), N. 2, 225-231. Zbl 0189.18901, MR 0215435
Reference: [6] I. Vajda: On statistical decision problems with finite parameter space.Kybernetika 3 (1967), N. 5, 451-466. MR 0223009
.

Files

Files Size Format View
AplMat_16-1971-4_1.pdf 1.828Mb application/pdf View/Open
Back to standard record
Partner of
EuDML logo