188 search results - page 14 / 38 » Finding Best k Policies |
ORDER
2008
13 years 9 months ago
2008
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
SIGMETRICS
2008
ACM
13 years 9 months ago
2008
ACM
Thermal management of DRAM memory has become a critical issue for server systems. We have done, to our best knowledge, the first study of software thermal management for memory su...
IJNM
2008
13 years 9 months ago
2008
Advance reservation of lightpaths in Grid environments is necessary to guarantee QoS and reliability. In this paper, we have evaluated and compared several algorithms for dynamic ...
PE
2010
Springer
13 years 4 months ago
2010
Springer
A central question in designing server farms today is how to efficiently provision the number of servers to extract the best performance under unpredictable demand patterns while ...
APPROX
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...