749 search results - page 106 / 150 » Dualities for Constraint Satisfaction Problems |
108
Voted
SODA
2000
ACM
15 years 1 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
128
Voted
AAAI
2000
15 years 1 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
ICALT
2008
IEEE
15 years 7 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 ...
CP
2006
Springer
15 years 4 months ago
2006
Springer
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
84
Voted
AAAI
2006
15 years 1 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...