Sciweavers

53 search results - page 1 / 11
» Minimally Infeasible Set-Partitioning Problems with Balanced...
Sort
View
MOR
2007
77views more  MOR 2007»
13 years 4 months ago
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
Michele Conforti, Marco Di Summa, Giacomo Zambelli
DFT
2006
IEEE
105views VLSI» more  DFT 2006»
13 years 11 months ago
Thermal-Aware SoC Test Scheduling with Test Set Partitioning and Interleaving
1 High temperature has become a major problem for system-on-chip testing. In order to reduce the test time while keeping the temperature of the chip under test within a safe range,...
Zhiyuan He, Zebo Peng, Petru Eles, Paul M. Rosinge...
TASLP
2010
82views more  TASLP 2010»
12 years 11 months ago
Psychoacoustically Constrained and Distortion Minimized Speech Enhancement
Abstract--This paper considers a psychoacoustically constrained and distortion minimized speech enhancement algorithm. Noise reduction, in general, leads to speech distortion, and ...
Seokhwan Jo, Chang D. Yoo
IRI
2006
IEEE
13 years 10 months ago
A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
Éric Grégoire, Bertrand Mazure, C&ea...
SAT
2005
Springer
129views Hardware» more  SAT 2005»
13 years 10 months ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah