717 search results - page 44 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
CP
2005
Springer
15 years 3 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
FLAIRS
2004
14 years 11 months ago
2004
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
CONSTRAINTS
2006
14 years 9 months ago
2006
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
ICCBR
2003
Springer
15 years 3 months ago
2003
Springer
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
ENDM
2000
14 years 9 months ago
2000
Both parametric design tasks and analysis tasks of technical systems have a similar problem setting: The structure of the system to be configured or analyzed is defined already. W...