Sciweavers

2714 search results - page 99 / 543
» Approximation Schemes for Scheduling
Sort
View
115
Voted
PROCEDIA
2010
123views more  PROCEDIA 2010»
15 years 1 months ago
Mean square convergence of a semidiscrete scheme for SPDEs of Zakai type driven by square integrable martingales
In this short note, a direct proof of L2 convergence of an Euler–Maruyama approximation of a Zakai equation driven by a square integrable martingale is shown. The order of conve...
Annika Lang
142
Voted
IPCCC
2007
IEEE
15 years 9 months ago
Adaptive Probabilistic Scheduling for a Cellular Emergency Network
Currently, wireless priority services (WPS) are provided using call queueing with a weighted round-robin schedule based on a fixed parameter. In this paper, we introduce a flexi...
Jiazhen Zhou, C. Beard
RTSS
1995
IEEE
15 years 7 months ago
Enhancing Real-Time Schedules to Tolerate Transient Faults
We present a scheme to guarantee that the execution of real-time tasks can tolerate transient and intermittent faults assuming any queue- based scheduling technique. The scheme is...
Sunondo Ghosh, Rami G. Melhem, Daniel Mossé
158
Voted
WINET
2011
14 years 10 months ago
Sleep scheduling with expected common coverage in wireless sensor networks
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor...
Eyuphan Bulut, Ibrahim Korpeoglu
125
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
The Complexity of Connectivity in Wireless Networks
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
Thomas Moscibroda, Roger Wattenhofer