3 search results - page 1 / 1 » CPR for CSPs: A Probabilistic Relaxation of Constraint Propa... |
67
Voted
NIPS
2007
14 years 11 months ago
2007
This paper proposes constraint propagation relaxation (CPR), a probabilistic approach to classical constraint propagation that provides another view on the whole parametric family...
IJCAI
2007
14 years 11 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
AAAI
2007
14 years 12 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...