Sciweavers

794 search results - page 39 / 159
» Stackelberg scheduling strategies
Sort
View
QSHINE
2009
IEEE
15 years 4 months ago
On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-Lived Sensor Networks
To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node rep...
Bin Tong, Zi Li, Guiling Wang, Wensheng Zhang
TACAS
2010
Springer
156views Algorithms» more  TACAS 2010»
14 years 7 months ago
Preemption Sealing for Efficient Concurrency Testing
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...
Thomas Ball, Sebastian Burckhardt, Katherine E. Co...
JPDC
2007
86views more  JPDC 2007»
14 years 9 months ago
Strategies to create platforms for differentiated services from dedicated and opportunistic resources
This paper is proposing a new platform for implementing services in future service oriented architectures. The basic premise of our proposal is that by combining large volume of u...
Shah Asaduzzaman, Muthucumaru Maheswaran
CDC
2009
IEEE
131views Control Systems» more  CDC 2009»
15 years 2 months ago
Optimal and adaptive battery discharge strategies for Cyber-Physical Systems
Abstract— We introduce a dynamic battery model that describes the variations of the capacity of a battery under time varying discharge current. This model is input-output equival...
Fumin Zhang, Zhenwu Shi
PE
2006
Springer
109views Optimization» more  PE 2006»
14 years 9 months ago
A discrete-time queueing model with periodically scheduled arrival and departure slots
We consider a time-slotted queueing model where each time slot can either be an arrival slot, in which new packets arrive, or a departure slot, in which packets are transmitted an...
Johan van Leeuwaarden, Dee Denteneer, Jacques Resi...