Sciweavers

9841 search results - page 45 / 1969
» Distributed Value Functions
Sort
View
PKDD
2010
Springer
129views Data Mining» more  PKDD 2010»
14 years 8 months ago
Smarter Sampling in Model-Based Bayesian Reinforcement Learning
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
Pablo Samuel Castro, Doina Precup
VALUETOOLS
2006
ACM
125views Hardware» more  VALUETOOLS 2006»
15 years 3 months ago
An approximative method for calculating performance measures of Markov processes
We present a new approximation method called value extrapolation for Markov processes with large or infinite state spaces. The method can be applied for calculating any performan...
Juha Leino, Jorma T. Virtamo
EUROPAR
2006
Springer
15 years 1 months ago
Applicability of Load Balancing Strategies to Data-Parallel Embedded Runge-Kutta Integrators
Abstract. Embedded Runge-Kutta methods are among the most popular methods for the solution of non-stiff initial value problems of ordinary differential equations (ODEs). We investi...
Matthias Korch, Thomas Rauber
ICML
2005
IEEE
15 years 10 months ago
Predicting probability distributions for surf height using an ensemble of mixture density networks
There is a range of potential applications of Machine Learning where it would be more useful to predict the probability distribution for a variable rather than simply the most lik...
Michael Carney, Padraig Cunningham, Jim Dowling, C...
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
14 years 9 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...