434 search results - page 59 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
93
Voted
ISPD
2004
ACM
15 years 2 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
ICWMC
2006
IEEE
15 years 3 months ago
2006
IEEE
Because of the heterogeneity in radio transceiver capabilities and influence of surroundings, unidirectional links arise in wireless mobile ad-hoc networks. Since most of existin...
HPDC
2005
IEEE
15 years 3 months ago
2005
IEEE
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
90
Voted
CAAN
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
ICCAD
2008
IEEE
15 years 6 months ago
2008
IEEE
We propose a post-placement physical synthesis algorithm that can apply multiple circuit synthesis and placement transforms on a placed circuit to improve the critical path delay ...