Sciweavers

975 search results - page 91 / 195
» Locality Optimization for Program Instances
Sort
View
IEEEPACT
2007
IEEE
14 years 4 months ago
A Loop Correlation Technique to Improve Performance Auditing
Performance auditing is an online optimization strategy that empirically measures the effectiveness of an optimization on a particular code region. It has the potential to greatly...
Jeremy Lau, Matthew Arnold, Michael Hind, Brad Cal...
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
14 years 1 months ago
Test scheduling for core-based systems
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
Krishnendu Chakrabarty
ATMOS
2008
187views Optimization» more  ATMOS 2008»
13 years 11 months ago
Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
Karl Nachtigall, Jens Opitz
COR
2008
88views more  COR 2008»
13 years 9 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
MP
2008
105views more  MP 2008»
13 years 9 months ago
On the strength of Gomory mixed-integer cuts as group cuts
Gomory mixed-integer (GMI) cuts generated from optimal simplex tableaus are known to be useful in solving mixed-integer programs. Further, it is well-known that GMI cuts can be de...
Sanjeeb Dash, Oktay Günlük