Sciweavers

398 search results - page 21 / 80
» A new biclustering technique based on crossing minimization
Sort
View
SAT
2005
Springer
129views Hardware» more  SAT 2005»
14 years 27 days 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
ICSE
2009
IEEE-ACM
14 years 2 months ago
MINTS: A general framework and tool for supporting test-suite minimization
Regression test suites tend to grow over time as new test cases are added to exercise new functionality or to target newly-discovered faults. When test suites become too large, th...
Hwa-You Hsu, Alessandro Orso
IPMI
2005
Springer
14 years 8 months ago
Approximating Anatomical Brain Connectivity with Diffusion Tensor MRI Using Kernel-Based Diffusion Simulations
We present a new technique for noninvasively tracing brain white matter fiber tracts using diffusion tensor magnetic resonance imaging (DT-MRI). This technique is based on performi...
Jun Zhang, Ning Kang, Stephen E. Rose
CP
2009
Springer
13 years 5 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
TCAD
1998
86views more  TCAD 1998»
13 years 7 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick