1224 search results - page 84 / 245 » Theory decision by decomposition |
163
click to vote
SODA
2010
ACM
16 years 3 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...
220
click to vote
POPL
2011
ACM
14 years 9 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...
160
click to vote
ECSQARU
2009
Springer
15 years 10 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 ...
164
click to vote
CISS
2008
IEEE
16 years 25 days 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...
191
click to vote
PRICAI
2000
Springer
15 years 10 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 ...