125 search results - page 17 / 25 » Boolean Satisfiability with Transitivity Constraints |
IDA
2005
Springer
14 years 3 months ago
2005
Springer
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
IDA
2006
Springer
13 years 9 months ago
2006
Springer
Clustering or co-clustering techniques have been proved useful in many application domains. A weakness of these techniques remains the poor support for grouping characterization. ...
ICCAD
2009
IEEE
13 years 7 months ago
2009
IEEE
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
AAAI
1997
13 years 11 months ago
1997
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...