657 search results - page 123 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
107
click to vote
SPAA
2009
ACM
16 years 6 days ago
2009
ACM
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
93
Voted
STOC
2009
ACM
16 years 8 days ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
SENSYS
2005
ACM
15 years 5 months ago
2005
ACM
Radio duty cycling has received significant attention in sensor networking literature, particularly in the form of protocols for medium access control and topology management. Whi...
KES
2005
Springer
15 years 5 months ago
2005
Springer
In KDD procedure, to fill in missing data typically requires a very large investment of time and energy - often 80% to 90% of a data analysis project is spent in making the data re...