569 search results - page 85 / 114 » Online Bounds for Bayesian Algorithms |
SIAMDM
2002
14 years 9 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
COLT
2010
Springer
14 years 7 months ago
2010
Springer
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
ALGORITHMICA
2005
14 years 9 months ago
2005
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...
IUI
2004
ACM
15 years 3 months ago
2004
ACM
Never before have so many information sources been available. Most are accessible on-line and some exist on the Internet alone. However, this large information quantity makes inte...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...