Sciweavers

614 search results - page 85 / 123
» Scheduling under resource constraints using dis-equations
Sort
View
JAIR
2007
111views more  JAIR 2007»
13 years 9 months ago
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
J. Christopher Beck, Nic Wilson
DAC
2007
ACM
14 years 10 months ago
Variation Resilient Low-Power Circuit Design Methodology using On-Chip Phase Locked Loop
This paper presents a variation resilient circuit design technique for maintaining parametric yield of design under inherent variation in process parameters. We propose to utilize...
Kunhyuk Kang, Kee-Jong Kim, Kaushik Roy
NIPS
2008
13 years 10 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
CODES
2004
IEEE
14 years 23 days ago
Operation tables for scheduling in the presence of incomplete bypassing
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
ENTCS
2006
183views more  ENTCS 2006»
13 years 9 months ago
Metamodel-Based Model Transformation with Aspect-Oriented Constraints
Model transformation means converting an input model available at the beginning of the transformation process to an output model. A widely used approach to model transformation us...
László Lengyel, Tihamer Levendovszky...