Sciweavers

77 search results - page 4 / 16
» Test Sets and Inequalities for Integer Programs
Sort
View
ASPDAC
1998
ACM
119views Hardware» more  ASPDAC 1998»
13 years 11 months ago
Integer Programming Models for Optimization Problems in Test Generation
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
João P. Marques Silva
VLSID
2002
IEEE
177views VLSI» more  VLSID 2002»
14 years 7 months ago
RTL-Datapath Verification using Integer Linear Programming
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
Raik Brinkmann, Rolf Drechsler
ORL
2008
111views more  ORL 2008»
13 years 7 months ago
Certificates of linear mixed integer infeasibility
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
Kent Andersen, Quentin Louveaux, Robert Weismantel
DISOPT
2011
175views Education» more  DISOPT 2011»
12 years 11 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük
CODES
2005
IEEE
14 years 1 months ago
An integer linear programming approach for identifying instruction-set extensions
This paper presents an Integer Linear Programming (ILP) approach to the instruction-set extension identification problem. An algorithm that iteratively generates and solves a set...
Kubilay Atasu, Günhan Dündar, Can C. &Ou...