407 search results - page 6 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
117
click to vote
SIGECOM
2011
ACM
14 years 7 days ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
103
click to vote
COLT
2010
Springer
14 years 7 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
WADS
2007
Springer
15 years 3 months ago
2007
Springer
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...