Sciweavers

CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 4 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
LPAR
2005
Springer
13 years 10 months ago
A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...
Alessandro Dal Palù, Agostino Dovier, Enric...