Sciweavers

428 search results - page 64 / 86
» FPGA-Based SAT Solver
Sort
View
CP
2009
Springer
14 years 2 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
AB
2007
Springer
14 years 1 months ago
Analyzing Pathways Using SAT-Based Approaches
Abstract. A network of reactions is a commonly used paradigm for representing knowledge about a biological process. How does one understand such generic networks and answer queries...
Ashish Tiwari, Carolyn L. Talcott, Merrill Knapp, ...
CAV
2009
Springer
139views Hardware» more  CAV 2009»
14 years 8 months ago
A Concurrent Portfolio Approach to SMT Solving
With the availability of multi-core processors and large-scale computing clusters, the study of parallel algorithms has been revived throughout the industry. We present a portfolio...
Christoph M. Wintersteiger, Leonardo Mendonç...
ICCD
2003
IEEE
177views Hardware» more  ICCD 2003»
14 years 4 months ago
SAT-Based Algorithms for Logic Minimization
This paper introduces a new method for two-level logic minimization. Unlike previous approaches, the new method uses a SAT solver as an underlying engine. While the overall minimi...
Samir Sapra, Michael Theobald, Edmund M. Clarke
SARA
2007
Springer
14 years 1 months ago
A Meta-CSP Model for Optimal Planning
One approach to optimal planning is to first start with a sub- optimal solution as a seed plan, and then iteratively search for shorter plans. This approach inevitably leads to an...
Peter Gregory, Derek Long, Maria Fox