Sciweavers

1299 search results - page 68 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
EOR
2007
174views more  EOR 2007»
14 years 9 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
ICCAD
1990
IEEE
57views Hardware» more  ICCAD 1990»
15 years 1 months ago
Floorplanning with Pin Assignment
We present a hierarchicaltechniquefor floorplanning and pin assignment of the general cell layouts. Given a set of cells with their shape lists, a layout aspect ratio, relative po...
Massoud Pedram, Malgorzata Marek-Sadowska, Ernest ...
POPL
1997
ACM
15 years 1 months ago
Synchronization Transformations for Parallel Computing
As parallel machines become part of the mainstream computing environment, compilers will need to apply synchronization optimizations to deliver e cient parallel software. This pap...
Pedro C. Diniz, Martin C. Rinard
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
15 years 11 months ago
Efficient Approximation Algorithms for Repairing Inconsistent Databases
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
Andrei Lopatenko, Loreto Bravo
SC
2005
ACM
15 years 3 months ago
A Power-Aware Run-Time System for High-Performance Computing
For decades, the high-performance computing (HPC) community has focused on performance, where performance is defined as speed. To achieve better performance per compute node, mic...
Chung-Hsing Hsu, Wu-chun Feng