Sciweavers

327 search results - page 41 / 66
» Comparative News Summarization Using Linear Programming
Sort
View
CP
2005
Springer
15 years 3 months ago
Breaking All Value Symmetries in Surjection Problems
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
Jean-Francois Puget
ASPDAC
2008
ACM
135views Hardware» more  ASPDAC 2008»
14 years 11 months ago
Temperature-aware MPSoC scheduling for reducing hot spots and gradients
Thermal hot spots and temperature gradients on the die need to be minimized to manufacture reliable systems while meeting energy and performance constraints. In this work, we solve...
Ayse Kivilcim Coskun, Tajana Simunic Rosing, Keith...
ICCD
2004
IEEE
105views Hardware» more  ICCD 2004»
15 years 6 months ago
Circuit-Based Preprocessing of ILP and Its Applications in Leakage Minimization and Power Estimation
In this paper we discuss the application of circuit-based logical reasoning to simplify optimization problems expressed as integer linear programs (ILP) over circuit states. We de...
Donald Chai, Andreas Kuehlmann
CEC
2007
IEEE
15 years 4 months ago
A histogram-matching approach to the evolution of bin-packing strategies
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
Riccardo Poli, John Woodward, Edmund K. Burke
SPIN
2004
Springer
15 years 3 months ago
Minimization of Counterexamples in SPIN
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
Paul Gastin, Pierre Moro, Marc Zeitoun