771 search results - page 26 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
107
Voted
SODA
2010
ACM
15 years 11 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...
120
click to vote
HCI
2009
14 years 11 months ago
2009
Sign language (SL) recognition modules in human-computer interaction systems need to be both fast and reliable. In cases where multiple sets of features are extracted from the SL d...
136
click to vote
TACAS
2007
Springer
15 years 8 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
150
click to vote
AIPS
2004
15 years 3 months ago
2004
The problem of optimal policy formulation for teams of resource-limited agents in stochastic environments is composed of two strongly-coupled subproblems: a resource allocation pr...
132
Voted
APN
2007
Springer
15 years 8 months ago
2007
Springer
In this work, we propose two high-level formalisms, Markov Decision Petri Nets (MDPNs) and Markov Decision Well-formed Nets (MDWNs), useful for the modeling and analysis of distrib...