116 search results - page 11 / 24 » Bounds for online bounded space hypercube packing |
120
Voted
COMPGEOM
1992
ACM
15 years 1 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
120
click to vote
SIGECOM
2011
ACM
14 years 9 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...
80
Voted
ORL
2010
14 years 4 months ago
2010
Recently, there has been a surge of interest in algorithms that allocate advertisement space in an online revenue-competitive manner. Most such algorithms, however, assume a pay-a...
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...
89
Voted
CORR
2008
Springer
14 years 9 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 ...