559 search results - page 42 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
92
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
139
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...
135
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Although algorithms for Distributed Constraint Optimization Problems (DCOPs) have emerged as a key technique for distributed reasoning, their application faces significa...
134
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
91
Voted
IJCAI
2003
15 years 4 months ago
2003
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...