657 search results - page 38 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
111
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
SIAMJO
2000
14 years 11 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
110
click to vote
TPDS
2008
14 years 11 months ago
2008
Recent technological advances have opened up a wide range of distributed real-time applications involving battery-driven embedded devices with local processing and wireless communi...
TMC
2010
14 years 10 months ago
2010
—We consider a wireless base station serving L users through L time-varying channels. It is well known that opportunistic scheduling algorithms with full channel state informatio...
137
click to vote
RTSS
1992
IEEE
15 years 3 months ago
1992
IEEE
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...