351 search results - page 19 / 71 » Perfect Constraints Are Tractable |
WG
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
CIAC
2010
Springer
14 years 5 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present an approximation theory for the extended answer set semantics, using the concept of an approximation constraint. Intuitively, an approximation constraint, whil...