835 search results - page 81 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
101
click to vote
WDAG
2007
Springer
15 years 6 months ago
2007
Springer
We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a...
AAAI
1998
15 years 1 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
185
click to vote
SCHEDULING
2011
14 years 7 months ago
2011
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â€...
117
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— We address a lifetime maximization problem for a single-hop wireless sensor network where multiple sensors encode and communicate their measurements of a Gaussian random source...
100
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...