An alternative method for construction of optimal sequential questionnaires
Kybernetika, Tome 17 (1981) no. 4, pp. 287-297
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{KYB_1981_17_4_a1,
author = {Jirou\v{s}ek, Radim},
title = {An alternative method for construction of optimal sequential questionnaires},
journal = {Kybernetika},
pages = {287--297},
year = {1981},
volume = {17},
number = {4},
mrnumber = {643916},
zbl = {0483.62068},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1981_17_4_a1/}
}
Jiroušek, Radim. An alternative method for construction of optimal sequential questionnaires. Kybernetika, Tome 17 (1981) no. 4, pp. 287-297. http://geodesic.mathdoc.fr/item/KYB_1981_17_4_a1/
[1] A. H. G. R. Kan: On Mitten's axioms for Branch-and-Bound. Operations Res. 24 (1976), 6, 1179-1178.
[2] L. G. Mitten: Branch-and-Bound methods. Operations Res. 18 (1970), 1, 24-34. | MR | Zbl
[3] H. J. Payne W. S. Meisel: An algorithm for constructing optimal binary decision trees. IEEE Trans. Comp. C-26 (1977), 9, 905-916. | MR
[4] R. Jiroušek: Distinguishability of States by Economical Sequential Questionnaires. (in Czech). Thesis, ÚTIA ČSAV, Praha 1978.
[5] R. Jiroušek: Bayes decision functions realized by sequential questionnaires. Trans. 8th Prague Conf. Inform. Theory, etc., Vol. C, Academia, Prague 1979, 187-202. | MR