Sciweavers

979 search results - page 48 / 196
» Optimal instruction scheduling using integer programming
Sort
View
UAI
2008
13 years 11 months ago
New Techniques for Algorithm Portfolio Design
We present and evaluate new techniques for designing algorithm portfolios. In our view, the problem has both a scheduling aspect and a machine learning aspect. Prior work has larg...
Matthew J. Streeter, Stephen F. Smith
ICALP
1992
Springer
14 years 2 months ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup
IPPS
1999
IEEE
14 years 2 months ago
Distributed Scheduling with Decomposed Optimization Criterion: Genetic Programming Approach
Abstract. A new approach to develop parallel and distributed scheduling algorithms for multiprocessor systems is proposed. Its main innovation lies in evolving a decomposition of t...
Franciszek Seredynski, Jacek Koronacki, Cezary Z. ...
SAT
2007
Springer
95views Hardware» more  SAT 2007»
14 years 4 months ago
Solving Multi-objective Pseudo-Boolean Problems
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
Martin Lukasiewycz, Michael Glaß, Christian ...
EACL
2009
ACL Anthology
13 years 7 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud