657 search results - page 68 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
AINA
2009
IEEE
15 years 6 months ago
2009
IEEE
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
112
click to vote
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract— In this paper, we address the problem of providing traffic quality of service and energy efficiency in ad hoc wireless networks. We consider a network that is shared ...
BIRTHDAY
2009
Springer
15 years 6 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
108
click to vote
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
ESA
2010
Springer
15 years 20 hour ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...