Sciweavers

Share
51 search results - page 1 / 11
» Probabilistic Continuous Constraint Satisfaction Problems
Sort
View
ICTAI
2008
IEEE
9 years 10 months ago
Probabilistic Continuous Constraint Satisfaction Problems
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncerta...
Elsa Carvalho, Jorge Cruz, Pedro Barahona
FOCS
1999
IEEE
9 years 8 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
IJIMAI
2016
82views more  IJIMAI 2016»
4 years 1 days ago
Solving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach
— A wide variety of real world optimization problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs). In this paper, we model this problem in terms of in ori...
Khalid Haddouch, Karim Elmoutaoukil, Mohamed Ettao...
CORR
2007
Springer
120views Education» more  CORR 2007»
9 years 3 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová
EVOW
2008
Springer
9 years 5 months ago
A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems
This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...
Bart G. W. Craenen, Ben Paechter
books