25 search results - page 5 / 5 » Optimal Online Scheduling With Arbitrary Hard Deadlines in M... |
CASES
2006
ACM
13 years 10 months ago
2006
ACM
Dynamic voltage scaling and sleep state control have been shown to be extremely effective in reducing energy consumption in CMOS circuits. Though plenty of research papers have st...
SPAA
2010
ACM
13 years 9 months ago
2010
ACM
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
IPSN
2009
Springer
13 years 11 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
FPGA
2010
ACM
13 years 4 months ago
2010
ACM
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...