Sciweavers

732 search results - page 48 / 147
» Termination of Integer Linear Programs
Sort
View
SOFSEM
2010
Springer
14 years 4 months ago
Improved Matrix Interpretation
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
Pierre Courtieu, Gladys Gbedo, Olivier Pons
DAC
2009
ACM
14 years 9 months ago
Retiming and recycling for elastic systems with early evaluation
Retiming and recycling are two transformations used to optimize the performance of latency-insensitive (a.k.a. synchronous elastic) systems. This paper presents an approach that c...
Dmitry Bufistov, Jordi Cortadella, Marc Galceran O...
ICCAD
2008
IEEE
98views Hardware» more  ICCAD 2008»
14 years 4 months ago
Performance optimization of elastic systems using buffer resizing and buffer insertion
Abstract—Buffer resizing and buffer insertion are two transformation techniques for the performance optimization of elastic systems. Different approaches for each technique have ...
Dmitry Bufistov, Jorge Júlvez, Jordi Cortad...
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
14 years 2 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
ISQED
2005
IEEE
81views Hardware» more  ISQED 2005»
14 years 1 months ago
An ILP Formulation for Reliability-Oriented High-Level Synthesis
Reliability decisions taken early in system design can bring significant benefits in terms of design quality. This paper presents a 0-1 integer linear programming (ILP) formulatio...
Suleyman Tosun, Ozcan Ozturk, Nazanin Mansouri, Er...