3628 search results - page 40 / 726 » The Decision Diffie-Hellman Problem |
127
click to vote
UAI
2000
15 years 3 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
115
click to vote
ICCBR
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Very often a planning problem can be formulated as a ranking problem: i.e. to find an order relation over a set of alternatives. The ranking of a finite set of alternat...
104
click to vote
ECML
2005
Springer
15 years 7 months ago
2005
Springer
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
132
click to vote
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
HICSS
1997
IEEE
15 years 6 months ago
1997
IEEE
The value for decision making of high-quality postsolution analysis of decision-supporting models can hardly be overestimated. Candle-lighting analysis (CLA) takes this notion ver...