Sciweavers

854 search results - page 107 / 171
» A General Vehicle Routing Problem
Sort
View
SPAA
2004
ACM
14 years 1 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
SIGCOMM
2005
ACM
14 years 1 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
INFOCOM
2002
IEEE
14 years 19 days ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
ATAL
2010
Springer
13 years 5 months ago
Occlusion-aware multi-UAV surveillance
We present an agent-based coordination and planning method for aerial surveillance of multiple urban areas using a group of fixed-wing unmanned aerial vehicles (UAVs). The method ...
Eduard Semsch, Michal Jakob, Dusan Pavlícek...
IWCMC
2006
ACM
14 years 1 months ago
Distributed obstacle localization in large wireless sensor networks
Obstacles are but pleasing for many aspects of large realworld sensor networks. Among other things, the presence of obstacles distort the sensor node localization process and migh...
Frank Reichenbach, Ralf Salomon, Dirk Timmermann