Sciweavers

115 search results - page 13 / 23
» A control-theoretical methodology for the scheduling problem
Sort
View
ICCAD
2005
IEEE
127views Hardware» more  ICCAD 2005»
15 years 7 months ago
Hardware synthesis from guarded atomic actions with performance specifications
We present a new hardware synthesis methodology for guarded atomic actions (or rules), which satisfies performance-related scheduling specifications provided by the designer. The ...
Daniel L. Rosenband
82
Voted
WSC
2007
15 years 25 days ago
Optimal scheduling of probabilistic repetitive projects using completed unit and genetic algorithms
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
Chachrist Srisuwanrat, Photios G. Ioannou
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
14 years 5 months ago
Universal scheduling for networks with arbitrary traffic, channels, and mobility
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
Michael J. Neely
94
Voted
WWW
2002
ACM
15 years 11 months ago
Multimedia meets computer graphics in SMIL2.0: a time model for the web
Multimedia scheduling models provide a rich variety of tools for managing the synchronization of media like video and audio, but generally have an inflexible model for time itself...
Patrick Schmitz
COMPSAC
2009
IEEE
15 years 5 months ago
Real-Time Guarantees in Flexible Advance Reservations
—This paper deals with the problem of scheduling workflow applications with Quality of Service (QoS) constraints, comprising real-time and interactivity constraints, over a servi...
Kleopatra Konstanteli, Dimosthenis Kyriazis, Theod...