657 search results - page 97 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
111
click to vote
OPODIS
2010
14 years 9 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
117
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
107
click to vote
ISCA
2012
IEEE
13 years 2 months ago
2012
IEEE
Modern memory controllers employ sophisticated address mapping, command scheduling, and power management optimizations to alleviate the adverse effects of DRAM timing and resource...
128
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—Surveillance systems, such as sensor networks and surveillance camera networks, have been widely deployed to monitor events in many different scenarios. One common way to conser...