Sciweavers

554 search results - page 52 / 111
» Approximability of OFDMA Scheduling
Sort
View
ESANN
2003
14 years 11 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer
IJHPCA
2006
96views more  IJHPCA 2006»
14 years 9 months ago
On the User - Scheduler Dialogue: Studies of User-Provided Runtime Estimates and Utility Functions
Effective communication between user and scheduler is an important prerequisite to achieving a successful scheduling outcome from both parties' perspectives. In a grid or sta...
Cynthia Bailey Lee, Allan Snavely
INFOCOM
2010
IEEE
14 years 8 months ago
Making the Case for Random Access Scheduling in Wireless Multi-hop Networks
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
Apoorva Jindal, Ann Arbor, Konstantinos Psounis
CAV
2009
Springer
116views Hardware» more  CAV 2009»
15 years 2 months ago
Priority Scheduling of Distributed Systems Based on Model Checking
Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is ...
Ananda Basu, Saddek Bensalem, Doron Peled, Joseph ...
ICNP
1999
IEEE
15 years 2 months ago
A Distributed Scheduling Algorithm for Quality of Service Support in Multiaccess Networks
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which o er no QoS guarant...
Craig Barrack, Kai-Yeung Siu