460 search results - page 19 / 92 » Bounding the locality of distributed routing algorithms |
SECON
2010
IEEE
13 years 5 months ago
2010
IEEE
Throughput maximization is a key challenge in cognitive radio ad hoc networks, where the availability of local spectrum resources may change from time to time and hopby-hop. To ach...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
COLT
1998
Springer
13 years 12 months ago
1998
Springer
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
WSC
2008
13 years 10 months ago
2008
In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good so...
TWC
2008
13 years 7 months ago
2008
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...