277 search results - page 27 / 56 » Just-In-Time Scheduling with Constraint Programming |
138
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
129
click to vote
ICCD
2000
IEEE
16 years 2 months ago
2000
IEEE
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer ...
123
click to vote
ANOR
2002
15 years 5 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
171
click to vote
DATE
2009
IEEE
16 years 19 days ago
2009
IEEE
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...
161
click to vote
CP
2007
Springer
16 years 1 days ago
2007
Springer
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...