97 search results - page 13 / 20 » Randomized algorithms for online bounded bidding |
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
AAAI
2007
13 years 9 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
ALT
2010
Springer
13 years 9 months ago
2010
Springer
We address the problem of constructing randomized online algorithms for the Metrical Task Systems (MTS) problem on a metric against an oblivious adversary. Restricting our attenti...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...