Error bounds on the probabilistically optimal problem solving strategy
From MaRDI portal
Publication:3185787
zbMATH Open1374.68497arXiv1506.02911MaRDI QIDQ3185787
Author name not available (Why is that?)
Publication date: 5 August 2016
Abstract: We consider a simple optimal probabilistic problem solving strategy that searches through potential solution candidates in a specific 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 effectivity (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.
Full work available at URL: https://arxiv.org/abs/1506.02911
No records found.
No records found.
This page was built for publication: Error bounds on the probabilistically optimal problem solving strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3185787)
