515 search results - page 48 / 103 » Approximating Markov Processes by Averaging |
129
click to vote
ICML
2001
IEEE
16 years 2 months ago
2001
IEEE
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
156
click to vote
ICFEM
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
115
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
122
click to vote
ISM
2008
IEEE
15 years 8 months ago
2008
IEEE
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...