Sciweavers

1719 search results - page 55 / 344
» Scheduling with soft constraints
Sort
View
ETFA
2008
IEEE
14 years 4 months ago
Optimal on-line (m, k)-firm constraint assignment for real-time control tasks based on plant state information
1 In this paper, we study the problem of scheduling a set of control tasks. We distinguish three different situations of states of controlled plants: not activated, steady state si...
Felicioni Flavia, Jia Ning, Françoise Simon...
INFOCOM
2002
IEEE
14 years 2 months ago
Maxmin fair scheduling in wireless networks
—We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints....
Leandros Tassiulas, Saswati Sarkar
AIPS
2003
13 years 11 months ago
Vehicle Routing and Job Shop Scheduling: What's the Difference?
Despite a number of similarities, vehicle routing problems and scheduling problems are typically solved with different techniques. In this paper, we undertake a systematic study o...
J. Christopher Beck, Patrick Prosser, Evgeny Selen...
EOR
2002
105views more  EOR 2002»
13 years 9 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler
CASES
2006
ACM
14 years 1 months ago
Cost-efficient soft error protection for embedded microprocessors
Device scaling trends dramatically increase the susceptibility of microprocessors to soft errors. Further, mounting demand for embedded microprocessors in a wide array of safety c...
Jason A. Blome, Shantanu Gupta, Shuguang Feng, Sco...