657 search results - page 59 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
STOC
1998
ACM
15 years 4 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
SAC
2009
ACM
15 years 6 months ago
2009
ACM
In this paper, we consider minimizing the system-level energy consumption through dynamic voltage scaling for embedded devices, while a) allowing concurrent access to shared objec...
118
click to vote
CSR
2010
Springer
15 years 4 months ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
100
click to vote
DAM
1999
14 years 11 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...