Sciweavers

2555 search results - page 12 / 511
» Quantifiers and Working Memory
Sort
View
AAAI
2000
15 years 4 months ago
A Distributed Algorithm to Evaluate Quantified Boolean Formulae
In this paper, we present PQSOLVE, a distributed theorem-prover for Quantified Boolean Formulae. First, we introduce our sequential algorithm QSOLVE, which uses new heuristics and...
Rainer Feldmann, Burkhard Monien, Stefan Schamberg...
GECCO
2003
Springer
15 years 8 months ago
Efficiency and Reliability of DNA-Based Memories
Associative memories based on DNA-affinity have been proposed [2]. Here, the performance, efficiency, reliability of DNA-based memories is quantified through simulations in silico....
Max H. Garzon, Andrew Neel, Hui Chen
116
Voted
JSAT
2010
121views more  JSAT 2010»
14 years 10 months ago
Resolution on Quantified Generalized Clause-sets.
This paper is devoted to investigate resolution for quantified generalized clause-sets (QCLS). The soundness and refutation completeness are proved. Then quantified generalized Ho...
Jiwei Jin, Xishun Zhao
APLAS
2007
ACM
15 years 7 months ago
The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer
We rationally reconstruct the core of the Coccinelle system, used for automating and documenting collateral evolutions in Linux device drivers. A denotational semantics of the syst...
Neil D. Jones, René Rydhof Hansen
137
Voted
FPL
2007
Springer
97views Hardware» more  FPL 2007»
15 years 7 months ago
An FPGA Approach to Quantifying Coherence Traffic Efficiency on Multiprocessor Systems
Recently, there is a surge of interests in using FPGAs for computer architecture research including applications from emulating and analyzing a new platform to accelerating microa...
Taeweon Suh, Shih-Lien Lu, Hsien-Hsin S. Lee