1951 search results - page 151 / 391 » An algorithm for improving graph partitions |
122
Voted
ASPDAC
2006
ACM
15 years 11 months ago
2006
ACM
- Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to improve via yield/relia...
161
Voted
PPSN
2004
Springer
15 years 10 months ago
2004
Springer
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...
125
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
140
click to vote
AAAI
2006
15 years 6 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
130
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...