Sciweavers

2796 search results - page 112 / 560
» The coolest path problem
Sort
View
INFOCOM
2002
IEEE
15 years 10 months ago
Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman
ICC
2008
IEEE
138views Communications» more  ICC 2008»
15 years 11 months ago
Localization of IP Links Faults Using Overlay Measurements
—Accurate fault detection and localization is essential to the efficient and economical operation of ISP networks. In addition, it affects the performance of Internet applicatio...
Mohammad Fraiwan, Manimaran Manimaran
ICRA
2003
IEEE
94views Robotics» more  ICRA 2003»
15 years 10 months ago
Enveloping obstacles with hexagonal metamorphic robots
Abstract— The problem addressed is the distributed reconfiguration of a metamorphic robot system composed of any number of two dimensional robots (modules). The initial configu...
Jennifer E. Walter, Elizabeth M. Tsai, Nancy M. Am...
CSR
2009
Springer
15 years 11 months ago
Partitioning Graphs into Connected Parts
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
Pim van 't Hof, Daniël Paulusma, Gerhard J. W...
146
Voted
LATIN
2010
Springer
15 years 3 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese