Threshold values of random K-SAT from the cavity method
Random Structures & Algorithms
Computing pure nash equilibria in graphical games via markov random fields
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
A new look at survey propagation and its generalizations
Journal of the ACM (JACM)
A parallel framework for loopy belief propagation
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Pairs of SAT-assignments in random Boolean formulæ
Theoretical Computer Science
SAT graph-based representation: A new perspective
Journal of Algorithms
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A comparative runtime analysis of heuristic algorithms for satisfiability problems
Artificial Intelligence
Justification-Based Local Search with Adaptive Noise Strategies
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
How much parallelism is there in irregular applications?
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Boolean satisfiability from theoretical hardness to practical success
Communications of the ACM - A Blind Person's Interaction with Technology
On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT)
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Neuron-Less Neural-Like Networks with Exponential Association Capacity at Tabula Rasa
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
A Better Algorithm for Random k-SAT
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Loopy Substructural Local Search for the Bayesian Optimization Algorithm
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Dependency parsing by belief propagation
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Using expectation maximization to find likely assignments for solving CSP's
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Relaxed survey propagation: a sum-product algorithm for Max-SAT
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Focusing generalizations of belief propagation on targeted queries
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Many-pairs mutual information for adding structure to belief propagation approximations
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
A spectral approach to analysing belief propagation for 3-colouring
Combinatorics, Probability and Computing
Nonlinear sparse-graph codes for lossy compression
IEEE Transactions on Information Theory
Structure-driven optimizations for amorphous data-parallel programs
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
A collaborative approach for multi-threaded SAT solving
International Journal of Parallel Programming
Decimation algorithm based on correlations for constraint satisfaction problems on random networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Relaxed survey propagation for the weighted maximum satisfiability problem
Journal of Artificial Intelligence Research
Boolean satisfiability on a graphics processor
Proceedings of the 20th symposium on Great lakes symposium on VLSI
Efficient generic search heuristics within the EMBP framework
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
On multi-threaded satisfiability solving with OpenMP
IWOMP'08 Proceedings of the 4th international conference on OpenMP in a new era of parallelism
Convergence of min-sum message-passing for convex optimization
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Achieving the rate-distortion bound with low-density generator matrix codes
IEEE Transactions on Communications
Join-graph propagation algorithms
Journal of Artificial Intelligence Research
Towards more efficient and effective LP-based algorithms for MRF optimization
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
A shape analysis for optimizing parallel graph programs
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Learning factorizations in estimation of distribution algorithms using affinity propagation
Evolutionary Computation
A Better Algorithm for Random $k$-SAT
SIAM Journal on Computing
Resource Allocation via Message Passing
INFORMS Journal on Computing
The decimation process in random k-SAT
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Towards accelerating irregular EDA applications with GPUs
Integration, the VLSI Journal
Efficient sequential clamping for lifted message passing
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
A simple algorithm for random colouring G(n, d/n) using (2 + ε)d colours
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Threshold behaviour of WalkSAT and focused metropolis search on random 3-satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
On belief propagation guided decimation for random k-SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Semi-supervised probability propagation on instance-attribute graphs
AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Complete convergence of message passing algorithms for some satisfiability problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Implementing survey propagation on graphics processing units
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Characterizing propagation methods for boolean satisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
The freezing threshold for k-colourings of a random graph
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
An exact tensor network for the 3SAT problem
Quantum Information & Computation
Survey: The consequences of eliminating NP solutions
Computer Science Review
Processor allocation for optimistic parallelization of irregular programs
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Choosing probability distributions for stochastic local search and the role of make versus break
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT)
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Resource Allocation via Message Passing
INFORMS Journal on Computing
Eigenvector centrality in industrial SAT instances
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Atomic-free irregular computations on GPUs
Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units
Decentralized constraint satisfaction
IEEE/ACM Transactions on Networking (TON)
On the interpolation between product-based message passing heuristics for SAT
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Local search for Boolean Satisfiability with configuration checking and subscore
Artificial Intelligence
Comprehensive score: towards efficient local search for SAT with long clauses
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A homography transform based higher-order MRF model for stereo matching
Pattern Recognition Letters
Artificial Intelligence: From programs to solvers
AI Communications - ECAI 2012 Turing and Anniversary Track
| Hi-index | 0.18 |
We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be most difficult when α = M/N is close to the experimental threshold αc separating the region where almost all formulas are SAT from the region where all formulas are UNSAT. Recent results from a statistical physics analysis suggest that the difficulty is related to the existence of a clustering phenomenon of the solutions when α is close to (but smaller than) αc. We introduce a new type of message passing algorithm which allows to find efficiently a satisfying assignment of the variables in this difficult region. This algorithm is iterative and composed of two main parts. The first is a message-passing procedure which generalizes the usual methods like Sum-Product or Belief Propagation: It passes messages that may be thought of as surveys over clusters of the ordinary messages. The second part uses the detailed probabilistic information obtained from the surveys in order to fix variables and simplify the problem. Eventually, the simplified problem that remains is solved by a conventional heuristic. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005