Geodesic
Heuristic methods of construction of sequential questionnaire
Kybernetika, Tome 11 (1975) no. 4, pp. 253-270 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 94A15 
@article{KYB_1975_11_4_a0,
     author = {Jirou\v{s}ek, Radim},
     title = {Heuristic methods of construction of sequential questionnaire},
     journal = {Kybernetika},
     pages = {253--270},
     year = {1975},
     volume = {11},
     number = {4},
     mrnumber = {0411831},
     zbl = {0316.94024},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1975_11_4_a0/}
}
TY  - JOUR
AU  - Jiroušek, Radim
TI  - Heuristic methods of construction of sequential questionnaire
JO  - Kybernetika
PY  - 1975
SP  - 253
EP  - 270
VL  - 11
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/KYB_1975_11_4_a0/
LA  - en
ID  - KYB_1975_11_4_a0
ER  - 
%0 Journal Article
%A Jiroušek, Radim
%T Heuristic methods of construction of sequential questionnaire
%J Kybernetika
%D 1975
%P 253-270
%V 11
%N 4
%U http://geodesic.mathdoc.fr/item/KYB_1975_11_4_a0/
%G en
%F KYB_1975_11_4_a0
Jiroušek, Radim. Heuristic methods of construction of sequential questionnaire. Kybernetika, Tome 11 (1975) no. 4, pp. 253-270. http://geodesic.mathdoc.fr/item/KYB_1975_11_4_a0/

[1] A. Feinstein: Foundation of Information Theory. McGraw Hill, New York 1958. | MR

[2] C. F. Picard: Quasi-questionnaire, codes and Huffman's length. Kybernetika 6 (1970), 6. | MR

[3] L. N. Landa: Opit primenenija matematičeskoj logiki i teorii informacii k nekotorym problemam obučenija. Voprosy psichologii (1962), 2, 19-40.

[4] D. E. Knuth: Optimal. Binary Search Trees. Acta informatica 1 (1971), 1.

[5] A. Renyi: On the enumeration of search-codes. Acta Math. Acad. Sci. Hung. 21 (1970), 27-33. | MR | Zbl

[6] S. Guiasu: On the most rational algorithm of recognition. Kybernetik 5 (sept. 1968), 109-113. | Zbl