1977 search results - page 18 / 396 » The satisfactory partition problem |
137
click to vote
ISPD
1999
ACM
15 years 10 months ago
1999
ACM
Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning...
163
click to vote
CASES
2001
ACM
15 years 9 months ago
2001
ACM
With the widening performance gap between processors and main memory, efficient memory accessing behavior is necessary for good program performance. Loop partition is an effective...
157
click to vote
APPROX
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
158
click to vote
IJDSN
2008
15 years 5 months ago
2008
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
140
click to vote
CASES
2007
ACM
15 years 9 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...