1051 search results - page 65 / 211 » Foundations of Constraint Satisfaction |
106
click to vote
CP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
117
click to vote
SAGA
2001
Springer
15 years 5 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
84
Voted
CP
2008
Springer
15 years 2 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
101
Voted
CORR
2007
Springer
15 years 15 days ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
105
Voted
CONSTRAINTS
1998
15 years 6 days ago
1998
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...