Heuristic methods of construction of sequential questionnaire
Kybernetika (1975)
- Volume: 11, Issue: 4, page (253)-270
- ISSN: 0023-5954
Access Full Article
topHow to cite
topReferences
top- A. Feinstein, Foundation of Information Theory, McGraw Hill, New York 1958. (1958) MR0095087
- C. F. Picard, Quasi-questionnaire, codes and Huffman's length, Kybernetika 6 (1970), 6. (1970) MR0284274
- L. N. Landa, Opit primenenija matematičeskoj logiki i teorii informacii k nekotorym problemam obučenija, Voprosy psichologii (1962), 2, 19-40. (1962)
- D. E. Knuth, Optimal. Binary Search Trees, Acta informatica 1 (1971), 1. (1971)
- A. Renyi, On the enumeration of search-codes, Acta Math. Acad. Sci. Hung. 21 (1970), 27-33. (1970) Zbl0228.05003MR0274194
- S. Guiasu, On the most rational algorithm of recognition, Kybernetik 5 (sept. 1968), 109-113. (1968) Zbl0177.48001