393 search results - page 26 / 79 » Personnel scheduling: Models and complexity |
CP
2005
Springer
15 years 5 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
102
click to vote
CPAIOR
2009
Springer
15 years 6 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
102
click to vote
EMSOFT
2004
Springer
15 years 5 months ago
2004
Springer
Cache prediction for preemptive scheduling is an open issue despite its practical importance. First analysis approaches use simplified models for cache behavior or they assume si...
DATE
2005
IEEE
15 years 5 months ago
2005
IEEE
Overheating has been acknowledged as a major issue in testing complex SOCs. Several power constrained system-level DFT solutions (power constrained test scheduling) have recently ...
135
click to vote
HPDC
2005
IEEE
15 years 5 months ago
2005
IEEE
Scheduling strategies for parallel and distributed computing have mostly been oriented toward performance, while striving to achieve some notion of fairness. With the increase in ...