1977 search results - page 19 / 396 » The satisfactory partition problem |
156
click to vote
ASPDAC
1999
ACM
15 years 10 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
139
click to vote
RE
1999
Springer
15 years 10 months ago
1999
Springer
One of the difficulties in requirements negotiation is to determine a feasible and mutually satisfactory set of requirements for the developer and the user, a problem related to C...
172
click to vote
JDA
2006
15 years 5 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
174
click to vote
DAC
2001
ACM
16 years 6 months ago
2001
ACM
Trends in the semiconductor industry towards extensive design and code reuse motivate a need for adequate Intellectual Property Protection (IPP) schemes. We offer a new general IP...
155
click to vote
EUROPAR
1999
Springer
15 years 10 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...