698 search results - page 2 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
ALDT
2009
Springer
13 years 12 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
ESA
2008
Springer
13 years 7 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
FLAIRS
2001
13 years 6 months ago
2001
Thewidespreaduse of influence diagramsto represent andsolve Bayesiandecision problemsis still limited by the inflexibility andrather restrictive semanticsof influence diagrams. In...
AIPS
1998
13 years 6 months ago
1998
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
SIAMCOMP
2008
13 years 5 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...