Sciweavers

614 search results - page 41 / 123
» Scheduling under resource constraints using dis-equations
Sort
View
CP
2009
Springer
14 years 2 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
RTS
2006
84views more  RTS 2006»
13 years 7 months ago
Finite-horizon scheduling of radar dwells with online template construction
Timing constraints for radar tasks are usually specified in terms of the minimum and maximum temporal distance between successive radar dwells. We utilize the idea of feasible int...
Sathish Gopalakrishnan, Marco Caccamo, Chi-Sheng S...
IJCAI
1989
13 years 8 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
DATE
2006
IEEE
98views Hardware» more  DATE 2006»
14 years 1 months ago
Power-constrained test scheduling for multi-clock domain SoCs
This paper presents a wrapper and test access mechanism design for multi-clock domain SoCs that consists of cores with different clock frequencies during test. We also propose a t...
Tomokazu Yoneda, Kimihiko Masuda, Hideo Fujiwara
GRID
2006
Springer
13 years 7 months ago
Metascheduling Multiple Resource Types using the MMKP
Grid computing involves the transparent sharing of computational resources of many types by users across large geographic distances. The altruistic nature of many current grid reso...
Daniel C. Vanderster, Nikitas J. Dimopoulos, Randa...