Sciweavers

2808 search results - page 70 / 562
» Routing betweenness centrality
Sort
View
SECON
2008
IEEE
15 years 11 months ago
Practical Algorithms for Gathering Stored Correlated Data in a Network
—Many sensing systems remotely monitor/measure an environment at several sites, and then report these observations to a central site. We propose and investigate several practical...
Ramin Khalili, James F. Kurose
W2GIS
2005
Springer
15 years 10 months ago
Refined Route Instructions Using Topological Stages of Closeness
In pedestrian navigation, navigators are free to choose any passable way. Because of this characteristic, accurate route instructions are important when navigating from waypoint to...
Markus Wuersch, David Caduff
161
Voted
DAC
1998
ACM
15 years 9 months ago
Global Routing with Crosstalk Constraints
—Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue in very l...
Hai Zhou, D. F. Wong
ISPD
2007
ACM
76views Hardware» more  ISPD 2007»
15 years 6 months ago
Semi-detailed bus routing with variation reduction
A bus routing algorithm is presented which not only minimizes wire length but also selects the bits in the bus to avoid twisting and conflicts. The resulting bus routes are regula...
Fan Mo, Robert K. Brayton
INFOCOM
2005
IEEE
15 years 10 months ago
Relating two formal models of path-vector routing
— This paper unifies two independently developed formalisms for path-vector routing protocols such as the Border Gateway Protocol (BGP), the standard inter-domain routing protoc...
Aaron D. Jaggard, Vijay Ramachandran