Search Sciweavers | Sciweavers

3 search results - page 1 / 1

» CPR for CSPs: A Probabilistic Relaxation of Constraint Propa...

click to vote

NIPS
2007

118views Information Technology» more NIPS 2007»

CPR for CSPs: A Probabilistic Relaxation of Constraint Propagation

13 years 6 months ago

Download books.nips.cc

This paper proposes constraint propagation relaxation (CPR), a probabilistic approach to classical constraint propagation that provides another view on the whole parametric family...

Luis E. Ortiz

claim paper

Read More »

click to vote

IJCAI
2007

161views Artificial Intelligence» more IJCAI 2007»

Probabilistic Consistency Boosts MAC and SAC

13 years 6 months ago

Download www.ijcai.org

Constraint Satisfaction Problems (CSPs) are ubiquitous in Artiﬁcial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...

Deepak Mehta, Marc R. C. van Dongen

claim paper

Read More »

click to vote

AAAI
2007

88views Intelligent Agents» more AAAI 2007»

Using Expectation Maximization to Find Likely Assignments for Solving CSP's

13 years 7 months ago

Download www.aaai.org

We present a new probabilistic framework for ﬁnding likely variable assignments in difﬁcult constraint satisfaction problems. Finding such assignments is key to efﬁcient sea...

Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...

claim paper

Read More »

« Prev « First page 1 / 1 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers