625 search results - page 30 / 125 » Semi-preemptive routing on trees |
DAC
1995
ACM
13 years 11 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
GLVLSI
2003
IEEE
14 years 21 days ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper describes the use of natural language route descriptions in the mobile robot navigation domain. Guided by corpus analysis and earlier work on coarse qualitative rout...
DAC
1998
ACM
13 years 11 months ago
1998
ACM
—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...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...