On extremum-searching approximate probabilistic algorithms
Kybernetika (1983)
- Volume: 19, Issue: 5, page 365-373
- ISSN: 0023-5954
Access Full Article
top
How to cite
topKramosil, Ivan. "On extremum-searching approximate probabilistic algorithms." Kybernetika 19.5 (1983): 365-373. <http://eudml.org/doc/28940>.
@article{Kramosil1983,
author = {Kramosil, Ivan},
journal = {Kybernetika},
keywords = {probabilistic algorithm; approximation of the maximum value of a recursive function},
language = {eng},
number = {5},
pages = {365-373},
publisher = {Institute of Information Theory and Automation AS CR},
title = {On extremum-searching approximate probabilistic algorithms},
url = {http://eudml.org/doc/28940},
volume = {19},
year = {1983},
}
TY - JOUR
AU - Kramosil, Ivan
TI - On extremum-searching approximate probabilistic algorithms
JO - Kybernetika
PY - 1983
PB - Institute of Information Theory and Automation AS CR
VL - 19
IS - 5
SP - 365
EP - 373
LA - eng
KW - probabilistic algorithm; approximation of the maximum value of a recursive function
UR - http://eudml.org/doc/28940
ER -
References
top- 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). (1974) MR0413592
- M. O. Rabin, Probabilistic algorithms, In: Proceedings of the Symposium 1976, Carnegie-Mellon Univ., Pittsburgh, Academic Press, New York 1976, pp. 21 - 39. (1976) Zbl0384.60001MR0464678
- I. Kramosil, Statistical verification procedures for propositional calculus, Computers and Artificial Intelligence 2 (1983), 3, 235-258. (1983) Zbl0529.68066
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.