1968 search results - page 24 / 394 » The Complexity of Valued Constraint Models |
CP
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
DL
1998
Springer
14 years 17 days ago
1998
Springer
In this paper we present a mechanism for translating information in heterogeneous digital library environments. We model information as a set of conjunctive constraints that are s...
COLING
2000
13 years 9 months ago
2000
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
CONSTRAINTS
2007
13 years 8 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
CP
2003
Springer
14 years 1 months ago
2003
Springer
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...