2808 search results - page 55 / 562 » Routing betweenness centrality |
125
Voted
CCCG
2006
15 years 6 months ago
2006
We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.
136
Voted
WDAG
2005
Springer
15 years 10 months ago
2005
Springer
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
146
Voted
IPPS
1997
IEEE
15 years 9 months ago
1997
IEEE
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. ...
142
click to vote
PAM
2009
Springer
15 years 11 months ago
2009
Springer
Estimate of packet-loss rates between arbitrary Internet hosts is critical for many large-scale distributed applications, including overlay routing, P2P media streaming, VoIP, and ...
109
click to vote
ICCAD
2000
IEEE
15 years 9 months ago
2000
IEEE
The incremental, “construct by correction” design methodology has become widespread in constraint-dominated DSM design. We study the problem of ECO for physical design domains...