3020 search results - page 344 / 604 » Optimal partition trees |
159
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
158
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
207
click to vote
ISSS
2000
IEEE
15 years 10 months ago
2000
IEEE
One important part of a HW/SW codesign system is the scheduler which is needed in order to determine if a given HW/SW partitioning is suitable for a given application. In this pap...
182
click to vote
USENIX
2000
15 years 8 months ago
2000
Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior, r...
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...