269 search results - page 20 / 54 » Online oblivious routing |
COLT
2004
Springer
14 years 27 days ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
On-line routing strategies for communication in a dynamic network on chip (DyNoC) environment are presented. The DyNoC has been presented as a medium supporting communication amon...
ICCBR
1995
Springer
13 years 11 months ago
1995
Springer
There have been several e orts to create and use real maps in computer applications that automatically nd good map routes. In general, online map representations do not include in...
PDCAT
2005
Springer
14 years 1 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...