Sciweavers

2343 search results - page 345 / 469
» The Locomotive Routing Problem
Sort
View
138
Voted
CN
2007
102views more  CN 2007»
15 years 5 months ago
The "Global-ISP" paradigm
We present a new paradigm, called “Global ISP” (G-ISP). Its goal is to solve, or at least alleviate, problems of inter-domain routing, such as slow convergence, and lack of Qo...
Reuven Cohen, Amnon Shochot
154
Voted
ENDM
2002
84views more  ENDM 2002»
15 years 4 months ago
Addressing the Petersen graph
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
Randall J. Elzinga, David A. Gregory, Kevin N. Van...
MP
2010
116views more  MP 2010»
15 years 3 months ago
New techniques for cost sharing in combinatorial optimization games
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for...
Alberto Caprara, Adam N. Letchford
SRDS
2010
IEEE
15 years 2 months ago
Lightweight Fault-Tolerance for Peer-to-Peer Middleware
We address the problem of providing transparent, lightweight, fault-tolerance mechanisms for generic peer-to-peer middleware systems. The main idea is to use the peer-to-peer overl...
Rolando Martins, Priya Narasimhan, Luis Lopes, Fer...
GLOBECOM
2009
IEEE
15 years 2 months ago
Joint Scheduling and Instantaneously Decodable Network Coding
We consider a wireless multi-hop network and design an algorithm for jointly optimal scheduling of packet transmissions and network coding. We consider network coding across differ...
Danail Traskov, Muriel Médard, Parastoo Sad...