2343 search results - page 350 / 469 » The Locomotive Routing Problem |
167
Voted
PODC
2005
ACM
15 years 10 months ago
2005
ACM
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
113
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
- Data path connection elements, such as multiplexers, consume a significant amount of area on a VLSI chip, especially for FPGA designs. Multiplexer optimization is a difficult pro...
148
click to vote
INFOVIS
2003
IEEE
15 years 10 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
132
Voted
APPROX
2000
Springer
15 years 9 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
139
Voted
ICCAD
1997
IEEE
15 years 9 months ago
1997
IEEE
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...