2084 search results - page 347 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
CLUSTER
2008
IEEE
15 years 4 months ago
2008
IEEE
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...
ISTCS
1993
Springer
15 years 1 months ago
1993
Springer
d Abstract) David P. Anderson Nimrod Megiddoy Moni Naorz April 1993 The \Minimum Reservation Rate Problem" arises in distributed systems for handling digital audio and video d...
120
click to vote
AMAI
2008
Springer
14 years 10 months ago
2008
Springer
This paper presents and evaluates an approach to Bayesian model averaging where the models are Bayesian nets (BNs). Prior distributions are defined using stochastic logic programs...
DKE
2006
14 years 9 months ago
2006
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...