Sciweavers

515 search results - page 35 / 103
» Approximating Markov Processes by Averaging
Sort
View
CISS
2008
IEEE
15 years 6 months ago
Rate adaptation via link-layer feedback for goodput maximization over a time-varying channel
Abstract—We consider adapting the transmission rate to maximize the goodput, i.e., the amount of data transmitted without error, over a continuous Markov flat-fading wireless ch...
Rohit Aggarwal, Phil Schniter, Can Emre Koksal
QUESTA
2008
205views more  QUESTA 2008»
14 years 11 months ago
Continuity of the M/G/c queue
Consider an M/G/c queue with homogeneous servers and service time distribution F. It is shown that an approximation of the service time distribution F by stochastically smaller di...
Lothar Breuer
PUK
2000
15 years 1 months ago
Dynamic Scheduling of Progressive Processing Plans
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
Shlomo Zilberstein, Abdel-Illah Mouaddib, Andrew A...
ICIP
2010
IEEE
14 years 9 months ago
Bayesian regularization of diffusion tensor images using hierarchical MCMC and loopy belief propagation
Based on the theory of Markov Random Fields, a Bayesian regularization model for diffusion tensor images (DTI) is proposed in this paper. The low-degree parameterization of diffus...
Siming Wei, Jing Hua, Jiajun Bu, Chun Chen, Yizhou...
FSTTCS
2006
Springer
15 years 3 months ago
Testing Probabilistic Equivalence Through Reinforcement Learning
We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...
Josee Desharnais, François Laviolette, Sami...