515 search results - page 16 / 103 » Approximating Markov Processes by Averaging |
ATAL
2004
Springer
14 years 24 days ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
JMLR
2006
2006
Geometric Variance Reduction in Markov Chains: Application to Value Function and Gradient Estimation
13 years 7 months ago
We study a sequential variance reduction technique for Monte Carlo estimation of functionals in Markov Chains. The method is based on designing sequential control variates using s...
GEOINFO
2004
13 years 8 months ago
2004
: Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a q...
SMI
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we propose a new and powerful shape denoising technique for processing surfaces approximated by triangle meshes and soups. Our approach is inspired by recent non-lo...
SIGMETRICS
2010
ACM
13 years 2 months ago
2010
ACM
Shortest Remaining Processing Time first (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such,...