1110 search results - page 63 / 222 » New Approximation Results for Resource Replication Problems |
189
click to vote
SIAMJO
2002
15 years 5 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 ...
153
click to vote
ICCAD
1999
IEEE
15 years 10 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...
149
click to vote
IPPS
2009
IEEE
16 years 20 days 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...
160
click to vote
MIDDLEWARE
2009
Springer
16 years 17 days 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...
138
click to vote
CC
2007
Springer
16 years 6 days 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. ...