559 search results - page 29 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
116
click to vote
SAC
2010
ACM
15 years 9 months ago
2010
ACM
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
153
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
132
click to vote
TIME
2002
IEEE
15 years 7 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
131
click to vote
AIMSA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
125
click to vote
CPAIOR
2004
Springer
15 years 6 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...