1Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Mlynska dolina 842 48 Bratislava,
Acta mathematica Universitatis Comenianae, Tome 85 (2016) no. 2, pp. 219-230
Citer cet article
Frantisek Duris; Frantisek Duris. Error bounds on the probabilistically optimal problem solving strategy. Acta mathematica Universitatis Comenianae, Tome 85 (2016) no. 2, pp. 219-230. http://geodesic.mathdoc.fr/item/AMUC_2016_85_2_a5/
@article{AMUC_2016_85_2_a5,
author = {Frantisek Duris and Frantisek Duris},
title = { Error bounds on the probabilistically optimal problem solving strategy},
journal = {Acta mathematica Universitatis Comenianae},
pages = {219--230},
year = {2016},
volume = {85},
number = {2},
url = {http://geodesic.mathdoc.fr/item/AMUC_2016_85_2_a5/}
}
TY - JOUR
AU - Frantisek Duris
AU - Frantisek Duris
TI - Error bounds on the probabilistically optimal problem solving strategy
JO - Acta mathematica Universitatis Comenianae
PY - 2016
SP - 219
EP - 230
VL - 85
IS - 2
UR - http://geodesic.mathdoc.fr/item/AMUC_2016_85_2_a5/
ID - AMUC_2016_85_2_a5
ER -
%0 Journal Article
%A Frantisek Duris
%A Frantisek Duris
%T Error bounds on the probabilistically optimal problem solving strategy
%J Acta mathematica Universitatis Comenianae
%D 2016
%P 219-230
%V 85
%N 2
%U http://geodesic.mathdoc.fr/item/AMUC_2016_85_2_a5/
%F AMUC_2016_85_2_a5
We consider a simple optimal probabilistic problem solving strategy that searches through potential solution candidates in a specic order. We are interested in what impact has interchanging the order of two solution candidates with respect to this optimal strategy on the problem solving eectivity (i.e., the solution candidates examined as well as time spent before solving the problem). Such interchange can happen in the applications with only partial information available. We derive bounds on these errors in general as well as in three special systems in which we impose some restrictions on the solution candidates.
