Sciweavers

1719 search results - page 87 / 344
» Scheduling with soft constraints
Sort
View
CONSTRAINTS
2011
13 years 5 months ago
A global constraint for total weighted completion time for unary resources
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
András Kovács, J. Christopher Beck
CP
2001
Springer
14 years 2 months ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken
EAAI
2008
101views more  EAAI 2008»
13 years 10 months ago
A global constraint for total weighted completion time for cumulative resources
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
András Kovács, J. Christopher Beck
INFOCOM
2010
IEEE
13 years 8 months ago
Practical Scheduling Algorithms for Concurrent Transmissions in Rate-adaptive Wireless Networks
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
Zhe Yang, Lin Cai, Wu-sheng Lu
DATE
2007
IEEE
71views Hardware» more  DATE 2007»
14 years 4 months ago
Task scheduling for reliable cache architectures of multiprocessor systems
This paper presents a task scheduling method for reliable cache architectures (RCAs) of multiprocessor systems. The RCAs dynamically switch their operation modes for reducing the ...
Makoto Sugihara, Tohru Ishihara, Kazuaki Murakami