277 search results - page 37 / 56 » Conditional Lexicographic Orders in Constraint Satisfaction ... |
211
click to vote
SPATIALCOGNITION
2000
Springer
15 years 9 months ago
2000
Springer
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
189
click to vote
CAV
2004
Springer
15 years 9 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
163
click to vote
SIAMMAX
2010
15 years 9 days ago
2010
In this paper, we consider estimating sparse inverse covariance of a Gaussian graphical model whose conditional independence is assumed to be partially known. Similarly as in [5],...
157
click to vote
CP
2008
Springer
15 years 7 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
108
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...