1051 search results - page 160 / 211 » Foundations of Constraint Satisfaction |
TALG
2010
13 years 8 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
CPAIOR
2010
Springer
13 years 8 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
SIGMOD
2011
ACM
13 years 22 days ago
2011
ACM
In a previous paper, we laid out the vision of declarative datadriven coordination (D3C) where users are provided with novel abstractions that enable them to communicate and coord...
POPL
2002
ACM
14 years 10 months ago
2002
ACM
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
DFT
2003
IEEE
14 years 3 months ago
2003
IEEE
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...