Sciweavers

Share
37 search results - page 1 / 8
» Exact Closest String as a Constraint Satisfaction Problem
Sort
View
CORR
2010
Springer
156views Education» more  CORR 2010»
9 years 5 months ago
The Exact Closest String Problem as a Constraint Satisfaction Problem
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
Tom Kelsey, Lars Kotthoff
PROCEDIA
2011
8 years 8 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
CORR
2007
Springer
120views Education» more  CORR 2007»
9 years 5 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová
WABI
2010
Springer
143views Bioinformatics» more  WABI 2010»
9 years 4 months ago
Swiftly Computing Center Strings
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
Franziska Hufsky, Léon Kuchenbecker, Kathar...
SAT
2004
Springer
117views Hardware» more  SAT 2004»
9 years 11 months ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
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...
Harold S. Connamacher
books