269 search results - page 10 / 54 » Online oblivious routing |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
ICPADS
1998
IEEE
13 years 11 months ago
1998
IEEE
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
QOFIS
2004
Springer
14 years 25 days ago
2004
Springer
Traffic engineering capabilities defined in MPLS enables QoS online routing of LSPs. In this paper we address issues of network survivability in online routing. We define a new lin...
ISAAC
1999
Springer
13 years 11 months ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
MFCS
2001
Springer
13 years 12 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...