1051 search results - page 23 / 211 » Foundations of Constraint Satisfaction |
CP
2004
Springer
15 years 3 months ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we present simple and genetic forms of an evolutionary paradigm known as a society of hill-climbers (SoHC). We compare these simple and genetic SoHCs on a test suite...
SAT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
SPDP
1991
IEEE
15 years 1 months ago
1991
IEEE
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
AAAI
1998
14 years 11 months ago
1998
In [4], Freuderdefines several types of interchangeability to capture the equivalenceamongthe valuesof a variable in a discrete constraint satisfaction problem(CSP), and provides ...