569 search results - page 11 / 114 » Online Bounds for Bayesian Algorithms |
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
ALGORITHMICA
2010
14 years 10 months ago
2010
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...
101
click to vote
STOC
2012
ACM
13 years 7 days ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...