33 search results - page 1 / 7 » Regret Minimization for Online Buffering Problems Using the ... |
ECCC
2010
13 years 5 months ago
2010
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
MASCOTS
2003
13 years 6 months ago
2003
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
COLT
2010
Springer
13 years 3 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...
ICML
2009
IEEE
14 years 6 months ago
2009
IEEE
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
ICDM
2003
IEEE
13 years 10 months ago
2003
IEEE
Algorithms for tracking concept drift are important for many applications. We present a general method based on the Weighted Majority algorithm for using any online learner for co...