Sciweavers

1719 search results - page 153 / 344
» Scheduling with soft constraints
Sort
View
WSC
1997
13 years 11 months ago
Creating a Flexible, Simulation-Based Finite Scheduling Tool
Today's business climate for manufacturers requires low inventory, quick response systems that turn out a wide variety of products. Since many companies are reaching physical...
Barbara W. Mazziotti, Richard E. Horne Jr.
INFOCOM
2010
IEEE
13 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
ICCD
2006
IEEE
126views Hardware» more  ICCD 2006»
14 years 7 months ago
Task Merging for Dynamic Power Management of Cyclic Applications in Real-Time Multi-Processor Systems
—In this paper we propose the method of task merging and idle period clustering for dynamic power management (DPM) in a real-time system with multiple processing elements. We sho...
Shaobo Liu, Qinru Qiu, Qing Wu
COORDINATION
2009
Springer
14 years 5 months ago
Fairness for Chorded Languages
Joins or chords is a concurrency construct that seems to fit well with the object oriented paradigm. Chorded languages are presented with implicit assumptions regarding the fair t...
Alexis Petrounias, Susan Eisenbach
CPAIOR
2004
Springer
14 years 3 months ago
Simple Rules for Low-Knowledge Algorithm Selection
This paper addresses the question of selecting an algorithm from a predefined set that will have the best performance on a scheduling problem instance. Our goal is to reduce the e...
J. Christopher Beck, Eugene C. Freuder