Sciweavers

717 search results - page 15 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
118 views 106 votes 15 years 5 months ago  CP 2006»
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
169 views 162 votes 14 years 11 months ago  CPAIOR 2010»
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
86 views 118 votes 15 years 6 months ago  CP 2001»
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
103 views 128 votes 15 years 5 months ago  FOCS 1999»
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...
96 views 111 votes 15 years 7 months ago  SARA 2007»
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
95 views 110 votes 15 years 7 months ago  AICCSA 2006»
: The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the ...
127 views 115 votes 15 years 5 months ago  PPSN 1998»
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
98 views 97 votes 15 years 8 months ago  FOCS 2009»
We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform Constraint Satisfaction Problems. This settles the conje...
134 views 118 votes 15 years 2 months ago  AAAI 1994»
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
131 views 115 votes 15 years 1 months ago  JAIR 2006»
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...