698 search results - page 21 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
CP
1998
Springer
14 years 1 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
ICRA
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
We give an optimal dynamic programming algorithm to solve a class of finite-horizon decentralized Markov decision processes (MDPs). We consider problems with a broadcast informati...
IJAR
2006
13 years 9 months ago
2006
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...