Previous |  Up |  Next

Article

Title: Heuristic methods of construction of sequential questionnaire (English)
Author: Jiroušek, Radim
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 11
Issue: 4
Year: 1975
Pages: (253)-270
.
Category: math
.
MSC: 94A15
idZBL: Zbl 0316.94024
idMR: MR0411831
.
Date available: 2009-09-24T16:46:20Z
Last updated: 2012-06-05
Stable URL: http://hdl.handle.net/10338.dmlcz/125027
.
Reference: [1] A. Feinstein: Foundation of Information Theory.McGraw Hill, New York 1958. MR 0095087
Reference: [2] C. F. Picard: Quasi-questionnaire, codes and Huffman's length.Kybernetika 6 (1970), 6. MR 0284274
Reference: [3] L. N. Landa: Opit primenenija matematičeskoj logiki i teorii informacii k nekotorym problemam obučenija.Voprosy psichologii (1962), 2, 19-40.
Reference: [4] D. E. Knuth: Optimal. Binary Search Trees.Acta informatica 1 (1971), 1.
Reference: [5] A. Renyi: On the enumeration of search-codes.Acta Math. Acad. Sci. Hung. 21 (1970), 27-33. Zbl 0228.05003, MR 0274194
Reference: [6] S. Guiasu: On the most rational algorithm of recognition.Kybernetik 5 (sept. 1968), 109-113. Zbl 0177.48001
.

Files

Files Size Format View
Kybernetika_11-1975-4_1.pdf 882.1Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo