58 search results - page 12 / 12 » Coding Constructions for Blacklisting Problems without Compu... |
DAC
2002
ACM
14 years 6 months ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
CADE
2001
Springer
14 years 5 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
BMCBI
2006
13 years 5 months ago
2006
Background: Comparing related structures and viewing the structures in the context of sequence alignments are important tasks in protein structure-function research. While many pr...