1381 search results - page 61 / 277 » Computational Complexity of Constraint Satisfaction |
146
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
149
click to vote
FOCI
2007
IEEE
15 years 10 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
162
click to vote
IJCAI
2001
15 years 5 months ago
2001
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
135
click to vote
HICSS
1994
IEEE
15 years 8 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
109
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
The optimization of the epoxy polymerization process involves a number of conflicting objectives and more than twenty decision parameters. In this paper, the problem is treated tr...