1719 search results - page 236 / 344 » Scheduling with soft constraints |
CODES
1997
IEEE
15 years 5 months ago
1997
IEEE
– Retargetability of embedded system descriptions not only enables better exploration of the design space and evaluation of cost/performance tradeoffs but also enhances design ma...
84
Voted
ICCAD
1997
IEEE
15 years 5 months ago
1997
IEEE
- Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register les must be preserved in order for the task to be resumed. This e...
111
click to vote
JSSPP
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...
97
Voted
AIR
1999
15 years 15 days ago
1999
The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints...
117
Voted
CP
2009
Springer
15 years 7 months ago
2009
Springer
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 ...