2272 search results - page 41 / 455 » Capture Complexity by Partition |
ICPADS
1998
IEEE
15 years 2 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
ICCSA
2010
Springer
14 years 11 months ago
2010
Springer
Nowadays, spatial analysis led on complex phenomenon implies the usage of data available on heterogeneous territorial meshes, that is to say misaligned meshes. Then, combine these ...
DCG
2007
14 years 9 months ago
2007
Motivated by Gauss’s first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bou...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- Recent studies have shown that cache partitioning is an efficient technique to improve throughput, fairness and Quality of Service (QoS) in CMP processors. The cache par...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...