714 search results - page 56 / 143 » Lexicographically-ordered constraint satisfaction problems |
SAGA
2001
Springer
14 years 3 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...
EAAI
2008
13 years 11 months ago
2008
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
CSCLP
2005
Springer
14 years 4 months ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
FLAIRS
2008
14 years 1 months ago
2008
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...