Previous |  Up |  Next


Title: Extremum-searching hierarchical parallel probabilistic algorithms (English)
Author: Kramosil, Ivan
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 24
Issue: 2
Year: 1988
Pages: 110-121
Category: math
MSC: 65W05
MSC: 68P10
MSC: 68Q25
MSC: 68T20
MSC: 90C27
idZBL: Zbl 0647.68061
idMR: MR942378
Date available: 2009-09-24T18:05:05Z
Last updated: 2012-06-05
Stable URL:
Reference: [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 0088081
Reference: [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 0796210
Reference: [3] J. Reif: On synchronous parallel computations with independent probabilistic choice.SIAM J. Comput. 13 (1984), 1, 46-55. Zbl 0558.68038, MR 0731026
Reference: [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.


Files Size Format View
Kybernetika_24-1988-2_3.pdf 577.1Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo