728 search results - page 117 / 146 » Efficient Searching with Linear Constraints |
109
click to vote
IJCAI
2003
15 years 1 months ago
2003
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
133
click to vote
BMCBI
2002
14 years 11 months ago
2002
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
114
click to vote
ICCAD
2009
IEEE
14 years 9 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...
112
click to vote
ITC
2003
IEEE
15 years 5 months ago
2003
IEEE
As technology evolves into the deep sub-micron era, signal integrity problems are growing into a major challenge. An important source of signal integrity problems is the crosstalk...
AAAI
2000
15 years 1 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...