1378 search results - page 34 / 276 » The Tractability of Global Constraints |
112
click to vote
GCB
1997
Springer
15 years 6 months ago
1997
Springer
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...
105
Voted
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and ...
SAT
2004
Springer
15 years 7 months ago
2004
Springer
The paper studies the use of global unobservability constraints in a CNF translation of Boolean formulas, where the unobservability of logic blocks is encoded with CNF unobservabil...
109
click to vote
VLSID
2002
IEEE
16 years 2 months ago
2002
IEEE
We describe a new algorithm for floorplan evaluation using timing-driven buffered routing according to a prescribed buffer site map. Specifically, we describe a provably good mult...
108
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...