Extremum-searching hierarchical parallel probabilistic algorithms

Ivan Kramosil

Kybernetika (1988)

  • Volume: 24, Issue: 2, page 110-121
  • ISSN: 0023-5954

How to cite

top

Kramosil, Ivan. "Extremum-searching hierarchical parallel probabilistic algorithms." Kybernetika 24.2 (1988): 110-121. <http://eudml.org/doc/28283>.

@article{Kramosil1988,
author = {Kramosil, Ivan},
journal = {Kybernetika},
keywords = {extremum-search; hierarchical parallel probabilistic algorithms; time computational complexity},
language = {eng},
number = {2},
pages = {110-121},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Extremum-searching hierarchical parallel probabilistic algorithms},
url = {http://eudml.org/doc/28283},
volume = {24},
year = {1988},
}

TY - JOUR
AU - Kramosil, Ivan
TI - Extremum-searching hierarchical parallel probabilistic algorithms
JO - Kybernetika
PY - 1988
PB - Institute of Information Theory and Automation AS CR
VL - 24
IS - 2
SP - 110
EP - 121
LA - eng
KW - extremum-search; hierarchical parallel probabilistic algorithms; time computational complexity
UR - http://eudml.org/doc/28283
ER -

References

top
  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). (1957) MR0088081
  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. (1985) MR0796210
  3. J. Reif, On synchronous parallel computations with independent probabilistic choice, SIAM J. Comput. 13 (1984), 1, 46-55. (1984) Zbl0558.68038MR0731026
  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. 

NotesEmbed ?

top

You must be logged in to post comments.