88 search results - page 3 / 18 » Scale-Free Algorithms for Online Linear Optimization |
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
INFOCOM
2005
IEEE
13 years 11 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
NIPS
2001
13 years 6 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
NIPS
2007
13 years 6 months ago
2007
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
AAIM
2009
Springer
13 years 12 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...