569 search results - page 104 / 114 » Online Bounds for Bayesian Algorithms |
COLT
2010
Springer
14 years 7 months ago
2010
Springer
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
101
click to vote
AI
2002
Springer
14 years 9 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
ALGORITHMICA
2004
14 years 9 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Dynamic real-time systems require adaptive resource management to accommodate varying processing needs. We address the problem of resource management with multiple shared resource...