Sciweavers

422 search results - page 69 / 85
» Multithreaded SAT Solving
Sort
View
ICDCS
2000
IEEE
14 years 2 months ago
The Effect of Nogood Learning in Distributed Constraint Satisfaction
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
Makoto Yokoo, Katsutoshi Hirayama
DNA
2006
Springer
159views Bioinformatics» more  DNA 2006»
14 years 1 months ago
Minimal Parallelism for Polarizationless P Systems
Minimal parallelism was recently introduced [3] as a way the rules of a P system are used: from each set of applicable rules associated to the same membrane, at least one must be a...
Tseren-Onolt Ishdorj
DBSEC
2006
160views Database» more  DBSEC 2006»
13 years 11 months ago
On Finding an Inference-Proof Complete Database for Controlled Query Evaluation
Abstract. Controlled Query Evaluation (CQE) offers a logical framework to prevent a user of a database from inadvertently gaining knowledge he is not allowed to know. By modeling t...
Joachim Biskup, Lena Wiese
IJISEC
2008
101views more  IJISEC 2008»
13 years 9 months ago
SAT-based model-checking for security protocols analysis
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
Alessandro Armando, Luca Compagna
JALC
2006
133views more  JALC 2006»
13 years 9 months ago
Power and Efficiency of Minimal Parallelism in Polarizationless P Systems
Minimal parallelism was recently introduced [3] as a way of using the rules of a P system: from each set of applicable rules associated to a membrane, at least one rule must be ap...
Tseren-Onolt Ishdorj