2808 search results - page 63 / 562 » Routing betweenness centrality |
131
Voted
VTC
2008
IEEE
15 years 11 months ago
2008
IEEE
—In this paper, we introduce a routing solution called “Landmark Overlays for Urban Vehicular Routing Environments” (LOUVRE), an approach that efficiently builds a landmark ...
135
Voted
ASPDAC
2006
ACM
15 years 11 months ago
2006
ACM
Three-dimensional integrated circuits (3D ICs) provide an attractive solution for improving circuit performance. Such solutions must be embedded in an electrothermally-conscious d...
123
click to vote
ISPD
1999
ACM
15 years 9 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
171
Voted
ISAAC
1999
Springer
15 years 9 months ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
156
click to vote
SPAA
2006
ACM
15 years 11 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...