Sciweavers

1578 search results - page 87 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
NETWORKS
2007
13 years 8 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
AAAI
2007
13 years 11 months ago
Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
Russell Bent, Pascal Van Hentenryck
SPAA
2004
ACM
14 years 2 months ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
14 years 2 months ago
Analysing Randomized Distributed Algorithms
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
Gethin Norman
IWCMC
2006
ACM
14 years 2 months ago
SCAR: context-aware adaptive routing in delay tolerant mobile sensor networks
Sensor devices are being embedded in all sorts of items including vehicles, furniture but also animal and human bodies through health monitors and tagging techniques. The collecti...
Cecilia Mascolo, Mirco Musolesi