116 search results - page 18 / 24 » On the solution-space geometry of random constraint satisfac... |
CP
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
STOC
2010
ACM
15 years 1 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
CP
2000
Springer
15 years 1 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
HIPC
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
92
Voted
IJCAI
2003
14 years 10 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...