Extremum-searching hierarchical parallel probabilistic algorithms
Kybernetika, Tome 24 (1988) no. 2, pp. 110-121
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{KYB_1988_24_2_a2,
author = {Kramosil, Ivan},
title = {Extremum-searching hierarchical parallel probabilistic algorithms},
journal = {Kybernetika},
pages = {110--121},
year = {1988},
volume = {24},
number = {2},
mrnumber = {942378},
zbl = {0647.68061},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1988_24_2_a2/}
}
Kramosil, Ivan. Extremum-searching hierarchical parallel probabilistic algorithms. Kybernetika, Tome 24 (1988) no. 2, pp. 110-121. http://geodesic.mathdoc.fr/item/KYB_1988_24_2_a2/
[1] W. Feller: An Introduction to Probability Theory and its Applications, Vol. I. John Wiley and Sons -- Chapman and Hall, New York--London 1957 (Russian translation: Mir, Moscow 1964). | MR
[2] U. Manber, M. Tompa: The complexity of problems on probabilistic, non-deterministic, and alternating decision trees. J. Assoc. Comput. Mach. 32 (1985), 3, 720-732. | MR
[3] J. Reif: On synchronous parallel computations with independent probabilistic choice. SIAM J. Comput. 13 (1984), 1, 46-55. | MR | Zbl
[4] I. Kramosil: Hierarchical connection of probabilistic approach and parallelism in searching tasks of artificial intelligence. In: Aplikace umělé inteligence AI' 87, 23-31. In Czech.