201 search results - page 25 / 41 » New Structural Decomposition Techniques for Constraint Satis... |
127
click to vote
BMCBI
2007
15 years 1 months ago
2007
Background: Joint alignment and secondary structure prediction of two RNA sequences can significantly improve the accuracy of the structural predictions. Methods addressing this p...
AAAI
2006
15 years 2 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
122
click to vote
IJCAI
1989
15 years 2 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
103
click to vote
ICMCS
1999
IEEE
15 years 5 months ago
1999
IEEE
Advances in networking and transmission of digital multimedia data will bring soon huge catalogues of music to users. Accessing these catalogues raises a problem for users and con...
122
click to vote
CP
2008
Springer
15 years 3 months ago
2008
Springer
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...