1110 search results - page 63 / 222 » New Approximation Results for Resource Replication Problems |
118
click to vote
SIAMJO
2002
14 years 11 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
ICCAD
1999
IEEE
15 years 3 months ago
1999
IEEE
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
IPPS
2009
IEEE
15 years 5 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
MIDDLEWARE
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Virtualization-based server consolidation is an important technique for cost and energy reductions in data center environments and a key enabler of cloud computing. Howev...
CC
2007
Springer
15 years 5 months ago
2007
Springer
To achieve high resource utilization for multi-issue Digital Signal Processors (DSPs), production compilers commonly include variants of the iterative modulo scheduling algorithm. ...