1719 search results - page 180 / 344 » Scheduling with soft constraints |
129
Voted
DCOSS
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
129
Voted
CSCLP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
146
click to vote
TMC
2012
13 years 3 months ago
2012
Abstract—We consider the problem of relay-assisted transmission for cellular networks. In the considered system, a source node together with n relay nodes are selected in a propo...
91
Voted
SOSP
2007
ACM
15 years 9 months ago
2007
ACM
Reliable storage systems depend in part on “write-before” relationships where some changes to stable storage are delayed until other changes commit. A journaled file system, ...
104
click to vote
FGCN
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we propose a real time scheduling policy over 802.11 DCF protocol called Deadline Monotonic (DM). We evaluate the performance of this policy for a simple scenario w...