1381 search results - page 57 / 277 » Computational Complexity of Constraint Satisfaction |
153
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
141
Voted
AAAI
2006
15 years 5 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
131
Voted
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
124
Voted
ICALT
2008
IEEE
15 years 10 months ago
2008
IEEE
Collaboration has long been considered an effective approach to learning. However, forming optimal groups can be a time consuming and complex task. Different approaches have been ...
143
Voted
JAIR
2011
14 years 11 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...