1952 search results - page 102 / 391 » Complete partitions of graphs |
139
click to vote
CONSTRAINTS
2008
15 years 4 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
135
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
141
click to vote
DATE
2004
IEEE
15 years 8 months ago
2004
IEEE
Many high-end DSP processors employ both multiple memory banks and heterogeneous register files to improve performance and power consumption. The complexity of such architectures ...
164
click to vote
ATS
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we present a technique for reducing the test length of counter-based pseudo-exhaustive built-in self-testing (BIST) based on width compression method. More formally...
134
click to vote
DAC
1989
ACM
15 years 8 months ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...