16 search results - page 3 / 4 » Chaff: Engineering an Efficient SAT Solver |
JCM
2007
13 years 6 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
SIGSOFT
2000
ACM
13 years 10 months ago
2000
ACM
An automatic analysis method for first-order logic with sets and relations is described. A first-order formula is translated to a quantifier-free boolean formula, which has a mode...
ICCAD
2009
IEEE
13 years 4 months ago
2009
IEEE
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
FM
2008
Springer
13 years 7 months ago
2008
Springer
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
ICCAD
2009
IEEE
13 years 4 months ago
2009
IEEE
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...