Sciweavers

193 search results - page 9 / 39
» sat 2007
Sort
View
ALGORITHMICA
2007
93views more  ALGORITHMICA 2007»
14 years 9 months ago
Random 2-SAT with Prescribed Literal Degrees
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
Colin Cooper, Alan M. Frieze, Gregory B. Sorkin
NIPS
2004
14 years 10 months ago
Comparing Beliefs, Surveys, and Random Walks
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice. We give, using only probabi...
Erik Aurell, Uri Gordon, Scott Kirkpatrick
ICAI
2003
14 years 10 months ago
Threshold Behavior in a Boolean Network Model for SAT
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
Alejandro Bugacov, Aram Galstyan, Kristina Lerman
72
Voted
JAR
2007
132views more  JAR 2007»
14 years 9 months ago
Visualizing SAT Instances and Runs of the DPLL Algorithm
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
Carsten Sinz