515 search results - page 53 / 103 » Approximating Markov Processes by Averaging |
164
click to vote
ECBS
2009
IEEE
16 years 27 days ago
2009
IEEE
Probabilistic models are useful for analyzing systems which operate under the presence of uncertainty. In this paper, we present a technique for verifying safety and liveness prop...
171
click to vote
AIPS
2009
15 years 7 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
188
Voted
IPPS
2008
IEEE
16 years 15 days ago
2008
IEEE
The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov Chain Mont...
209
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
135
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...