405 search results - page 44 / 81 » On the Complexity of Global Constraint Satisfaction |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...
STOC
2006
ACM
15 years 11 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 ...
111
Voted
IJCAI
2001
15 years 14 days 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...
102
click to vote
CEC
2010
IEEE
15 years 6 days ago
2010
IEEE
The optimization of spacecraft trajectories can be formulated as a global optimization task. The complexity of the problem depends greatly on the problem formulation, on the spacec...
CPAIOR
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...