569 search results - page 82 / 114 » Online Bounds for Bayesian Algorithms |
104
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
101
click to vote
DAC
2006
ACM
15 years 3 months ago
2006
ACM
Statistical static timing analysis (SSTA) has been a popular research topic in recent years. A fundamental issue with applying SSTA in practice today is the lack of reliable and e...
ICML
2008
IEEE
16 years 22 days ago
2008
IEEE
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
IUI
2009
ACM
15 years 8 months ago
2009
ACM
The TaskTracer system allows knowledge workers to define a set of activities that characterize their desktop work. It then associates with each user-defined activity the set of ...
115
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...