Sciweavers

77 search results - page 10 / 16
» Test Sets and Inequalities for Integer Programs
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 9 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
ISSRE
2002
IEEE
14 years 13 days ago
Mutation of Java Objects
Fault insertion based techniqueshave been used for measuring test adequacy and testability of programs. Mutation analysis inserts faults into a program with the goal of creating m...
Roger T. Alexander, James M. Bieman, Sudipto Ghosh...
CPAIOR
2011
Springer
12 years 11 months ago
Optimization Methods for the Partner Units Problem
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...
Markus Aschinger, Conrad Drescher, Gerhard Friedri...
ATS
2005
IEEE
164views Hardware» more  ATS 2005»
13 years 9 months ago
A Family of Logical Fault Models for Reversible Circuits
Reversibility is of interest in achieving extremely low power dissipation; it is also an inherent design requirement of quantum computation. Logical fault models for conventional ...
Ilia Polian, Thomas Fiehn, Bernd Becker, John P. H...
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
13 years 7 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo