37 search results - page 3 / 8 » Exact Closest String as a Constraint Satisfaction Problem |
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...
CPM
2000
Springer
13 years 9 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
EVOW
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
LICS
2010
IEEE
13 years 2 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
EAAI
2008
13 years 4 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...