6142 search results - page 4 / 1229 » The Complexity of Partition Functions |
VLSID
2003
IEEE
14 years 7 months ago
2003
IEEE
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper, we provide a flexible and automatic method to partition the functional space for efficient symbolic simulation. We utilize a 2-tuple list representation as the basi...
APNOMS
2009
Springer
13 years 5 months ago
2009
Springer
The inherent and increasing complexity, heterogeneity and unpredictability of computer networks make the task of managing these systems highly complex. The autonomic computing para...
SIAMCOMP
1998
13 years 7 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
STOC
1996
ACM
13 years 11 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...