146 search results - page 2 / 30 » Optimally Solving the MCM Problem Using Pseudo-Boolean Satis... |
DATE
2008
IEEE
13 years 7 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
TACAS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
AB
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
ISLPED
2010
ACM
13 years 5 months ago
2010
ACM
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
The focus of this paper is to provide a framework for the joint optimization of both the coefficient quantization and multiple constant multiplication (MCM) problems. It is known...