Sciweavers

942 search results - page 141 / 189
» Distance Constraint Satisfaction Problems
Sort
View
VMCAI
2007
Springer
15 years 9 months ago
Invariant Synthesis for Combined Theories
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, A...
CP
2005
Springer
15 years 8 months ago
Symmetry and Consistency
We introduce a novel and exciting research area: symmetrising levels of consistency to produce stronger forms of consistency and more efficient mechanisms for establishing them. W...
Ian P. Gent, Tom Kelsey, Steve Linton, Colva M. Ro...
ECAI
2004
Springer
15 years 8 months ago
Postponing Branching Decisions
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
Willem Jan van Hoeve, Michela Milano
113
Voted
CSCLP
2003
Springer
15 years 8 months ago
Experimental Evaluation of Interchangeability in Soft CSPs
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings
CSMR
1998
IEEE
15 years 7 months ago
Assessing Architectural Complexity
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
Rick Kazman, M. Burth