91 search results - page 8 / 19 » Routing Flow Through a Strongly Connected Graph |
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— Stochastic self-reconfiguring robots are modular robots that possess the ability to autonomously change the arrangement of their modules and do so through the use of nondetermi...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
IFIP
2005
Springer
14 years 1 months ago
2005
Springer
Nearly all network applications rely on the global Internet routing infrastructure to compute routes and deliver packets. Unfortunately, false Internet routes can be maliciously in...
SIGMETRICS
2003
ACM
14 years 22 days ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
MICRO
2008
IEEE
14 years 1 months ago
2008
IEEE
As companies move towards many-core chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scala...