Sciweavers

16404 search results - page 3233 / 3281
» A set coverage problem
Sort
View
AI
2005
Springer
15 years 14 days ago
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
Zhao Xing, Weixiong Zhang
TCAD
2008
101views more  TCAD 2008»
15 years 14 days ago
Using Field-Repairable Control Logic to Correct Design Errors in Microprocessors
Functional correctness is a vital attribute of any hardware design. Unfortunately, due to extremely complex architectures, widespread components, such as microprocessors, are often...
Ilya Wagner, Valeria Bertacco, Todd M. Austin
127
Voted
TCAD
2008
96views more  TCAD 2008»
15 years 14 days ago
An Implicit Approach to Minimizing Range-Equivalent Circuits
Abstract--Simplifying a combinational circuit while preserving its range has a variety of applications, such as combinational equivalence checking and random simulation. Previous a...
Yung-Chih Chen, Chun-Yao Wang
121
Voted
TCBB
2008
107views more  TCBB 2008»
15 years 14 days ago
Coclustering of Human Cancer Microarrays Using Minimum Sum-Squared Residue Coclustering
It is a consensus in microarray analysis that identifying potential local patterns, characterized by coherent groups of genes and conditions, may shed light on the discovery of pre...
Hyuk Cho, Inderjit S. Dhillon
ASE
2005
140views more  ASE 2005»
15 years 13 days ago
Automated Procedure Construction for Deductive Synthesis
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
Steve Roach, Jeffrey Van Baalen
« Prev « First page 3233 / 3281 Last » Next »