On extremum-searching approximate probabilistic algorithms
Kybernetika, Tome 19 (1983) no. 5, pp. 365-373
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{KYB_1983_19_5_a0,
author = {Kramosil, Ivan},
title = {On extremum-searching approximate probabilistic algorithms},
journal = {Kybernetika},
pages = {365--373},
year = {1983},
volume = {19},
number = {5},
mrnumber = {729029},
zbl = {0543.03029},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1983_19_5_a0/}
}
Kramosil, Ivan. On extremum-searching approximate probabilistic algorithms. Kybernetika, Tome 19 (1983) no. 5, pp. 365-373. http://geodesic.mathdoc.fr/item/KYB_1983_19_5_a0/
[1] A. V. Aho J. E. Hopcroft, J. D. Ullman: The Design and Analysis of Computer Algorithms. Reading, Addison-Wesley, London 1974 (Russian translation: Mir, Moscow 1978). | MR
[2] M. O. Rabin: Probabilistic algorithms. In: Proceedings of the Symposium 1976, Carnegie-Mellon Univ., Pittsburgh, Academic Press, New York 1976, pp. 21 - 39. | MR | Zbl
[3] I. Kramosil: Statistical verification procedures for propositional calculus. Computers and Artificial Intelligence 2 (1983), 3, 235-258. | Zbl