Sciweavers

Share
26 search results - page 2 / 6
» sat 2011
Sort
View
CORR
2011
Springer
144views Education» more  CORR 2011»
7 years 11 months ago
Analyzing Walksat on random formulas
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
Amin Coja-Oghlan, Alan M. Frieze
FROCOS
2011
Springer
7 years 6 months ago
Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...
Alberto Griggio, Quoc-Sang Phan, Roberto Sebastian...
AI
2011
Springer
7 years 10 months ago
Finding Small Backdoors in SAT Instances
Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...
Zijie Li, Peter van Beek
TDSC
2011
8 years 2 months ago
SAT: A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks
—Anonymity has received increasing attention in the literature due to the users’ awareness of their privacy nowadays. Anonymity provides protection for users to enjoy network s...
Jinyuan Sun, Chi Zhang, Yanchao Zhang, Yuguang Fan...
PADL
2011
Springer
7 years 10 months ago
Plato: A Compiler for Interactive Web Forms
Abstract. Modern web forms interact with the user in real-time by detecting errors and filling-in implied values, which in terms of automated reasoning amounts to SAT solving and ...
Timothy L. Hinrichs
books