Sciweavers

4 search results - page 1 / 1
» Link-Time Compaction of MIPS Programs
Sort
View
CSREAESA
2004
13 years 5 months ago
Link-Time Compaction of MIPS Programs
Embedded systems often have limited amounts of available memory, thus encouraging the development of compact programs. This paper presents a link-time program compactor for the emb...
Matias Madou, Bjorn De Sutter, Bruno De Bus, Ludo ...
COR
2011
12 years 11 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
CODES
2008
IEEE
13 years 6 months ago
Specification-based compaction of directed tests for functional validation of pipelined processors
Functional validation is a major bottleneck in microprocessor design methodology. Simulation is the widely used method for functional validation using billions of random and biase...
Heon-Mo Koo, Prabhat Mishra
ENDM
2010
167views more  ENDM 2010»
13 years 1 months ago
Column Generation based Primal Heuristics
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Exte...
C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, Fr...