4037 search results - page 8 / 808 » Routing without ordering |
COLING
1996
13 years 9 months ago
1996
CSL
2010
Springer
13 years 8 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
DAC
2010
ACM
13 years 11 months ago
2010
ACM
We propose a parallel global routing algorithm that concurrently processes routing subproblems corresponding to rectangular subregions covering the chip area. The algorithm uses a...
ICCAD
2004
IEEE
14 years 4 months ago
2004
IEEE
We propose two new FPGA routing switch designs that are programmable to operate in three different modes: highspeed, low-power or sleep. High-speed mode provides similar power an...