1224 search results - page 84 / 245 » Theory decision by decomposition |
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
143
click to vote
POPL
2011
ACM
14 years 3 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
96
Voted
ECSQARU
2009
Springer
15 years 4 months ago
2009
Springer
The Transferable Belief Model is a powerful interpretation of belief function theory where decision making is based on the pignistic transform. Smets has proposed a generalization ...
93
Voted
CISS
2008
IEEE
15 years 7 months ago
2008
IEEE
We survey our work on adaptive multiresolution (MR) approaches to the classification of biological images. The system adds MR decomposition in front of a generic classifier cons...
129
click to vote
PRICAI
2000
Springer
15 years 4 months ago
2000
Springer
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...