Sciweavers

601 search results - page 105 / 121
» Edge-dominating cycles in graphs
Sort
View
96
Voted
AI
2005
Springer
15 years 11 days ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf
TCAD
1998
114views more  TCAD 1998»
15 years 3 days ago
Behavioral optimization using the manipulation of timing constraints
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
Miodrag Potkonjak, Mani B. Srivastava
108
Voted
KBSE
2010
IEEE
14 years 11 months ago
Test generation to expose changes in evolving programs
Software constantly undergoes changes throughout its life cycle, and thereby it evolves. As changes are introduced into a code base, we need to make sure that the effect of the ch...
Dawei Qi, Abhik Roychoudhury, Zhenkai Liang
113
Voted
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
14 years 10 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
BMCBI
2010
160views more  BMCBI 2010»
14 years 7 months ago
eHive: An Artificial Intelligence workflow system for genomic analysis
Background: The Ensembl project produces updates to its comparative genomics resources with each of its several releases per year. During each release cycle approximately two week...
Jessica Severin, Kathryn Beal, Albert J. Vilella, ...