749 search results - page 128 / 150 » Dualities for Constraint Satisfaction Problems |
CSCLP
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
CSMR
1998
IEEE
14 years 2 months ago
1998
IEEE
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...
CP
2006
Springer
14 years 1 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
ICST
2010
IEEE
13 years 8 months ago
2010
IEEE
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...
CPAIOR
2009
Springer
14 years 4 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...