711 search results - page 19 / 143 » Amalgams of Constraint Satisfaction Problems |
101
click to vote
AAAI
1998
15 years 1 months ago
1998
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
— The dynamic composition of systems of networked appliances, or virtual devices, enables users to generate complex strong specific systems. Current prominent MANET-based composi...
SETN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...
FLAIRS
2003
15 years 1 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
AAAI
1998
15 years 1 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...