711 search results - page 121 / 143 » Amalgams of Constraint Satisfaction Problems |
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
CSCLP
2003
Springer
15 years 5 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 ...
123
click to vote
CSMR
1998
IEEE
15 years 4 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
15 years 3 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
14 years 10 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...