Sciweavers

442 search results - page 43 / 89
» Discovering Heuristic Strategy for Solving Scheduling Proble...
Sort
View
CP
2001
Springer
15 years 8 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
146
Voted
RSEISP
2007
Springer
15 years 9 months ago
The Art of Granular Computing
The current research in granular computing is dominated by set-theoretic models such as rough sets and fuzzy sets. By recasting the existing studies in a wider context, we propose ...
Yiyu Yao
PLDI
2006
ACM
15 years 9 months ago
Automatic instruction scheduler retargeting by reverse-engineering
In order to generate high-quality code for modern processors, a compiler must aggressively schedule instructions, maximizing resource utilization for execution efficiency. For a ...
Matthew J. Bridges, Neil Vachharajani, Guilherme O...
143
Voted
CP
2008
Springer
15 years 4 months ago
Search Strategies for Rectangle Packing
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
Helmut Simonis, Barry O'Sullivan
138
Voted
HEURISTICS
2010
15 years 1 months ago
A shift sequence based approach for nurse scheduling and a new benchmark dataset
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
Peter Brucker, Edmund K. Burke, Timothy Curtois, R...