A New Algorithm for Sampling CSP Solutions Uniformly at Random
نویسندگان
چکیده
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. Our method relies on expressing the constraint network as a uniform probability distribution over its solutions and then sampling from the distribution using state-of-the-art probabilistic sampling schemes. To speed up the rate at which random solutions are generated, we augment our sampling schemes with pruning techniques used successfully in the CSP literature such as conflict-directed back-jumping and no-good learning.
منابع مشابه
ar X iv : 0 80 3 . 21 22 v 1 [ m at h . C O ] 1 4 M ar 2 00 8 Random Solutions of Random Problems . . . are not just Random
Let In,m denote a uniformly random instance of some constraint satisfaction problem CSP with n variables and m constraints. Assume that the density r = m/n is small enough so that with high probability In,m has a solution, and consider the experiment of first choosing an instance I = In,m at random, and then sampling a random solution σ of I (if one exists). For many CSPs (e.g., k-SAT, k-NAE, o...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملRapidly exploring Random Orienteering
Data gathering in the physical world is tedious and often risky. Robots are ideally suited for such applications. The objective of a data gathering robot is to travel between two points maximizing the information it gains while not exceeding energy or cost constraints. This problem can be formalized as that of finding budgeted routes in a graph such that the reward collected by the route is max...
متن کاملPerturbed Message Passing for CSP Perturbed Message Passing for Constraint Satisfaction Problems
We introduce an efficient message passing scheme for solving Constraint Satisfaction Problems (CSPs), which uses stochastic perturbation of Belief Propagation (BP) and Survey Propagation (SP) messages to bypass decimation and directly produce a single satisfying assignment. Our first CSP solver, called Perturbed Belief Propagation, smoothly interpolates two well-known inference procedures; it s...
متن کاملA new class of general nonlinear random set-valued variational inclusion problems involving A-maximal m-relaxed η-accretive mappings and random fuzzy mappings in Banach spaces
At the present article, we consider a new class of general nonlinear random Amaximal m-relaxed h-accretive equations with random relaxed cocoercive mappings and random fuzzy mappings in q-uniformly smooth Banach spaces. By using the resolvent mapping technique for A-maximal m-relaxed h-accretive mappings due to Lan et al. and Chang’s lemma, we construct a new iterative algorithm with mixed erro...
متن کامل