559 search results - page 87 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
IAT
2006
IEEE
14 years 2 months ago
2006
IEEE
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
TCC
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
ICCAD
1999
IEEE
14 years 1 months ago
1999
IEEE
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorit...
ECAI
2004
Springer
14 years 14 days ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
CORR
1998
Springer
13 years 8 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...