515 search results - page 85 / 103 » Approximating Markov Processes by Averaging |
HYBRID
2007
Springer
14 years 5 months ago
2007
Springer
We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based tec...
QEST
2005
IEEE
14 years 4 months ago
2005
IEEE
A framework to assess transient performance measures is introduced by generalizing the theory of the quasi Birthand-Death (QBD) paradigm to QBDs with marked time epochs (QBDm ). T...
EMMCVPR
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
AI
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
AAAI
2008
14 years 1 months ago
2008
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...