Approximating Partial Interchangeability in CSP Solutions.
Nicoleta NeaguBoi FaltingsPublished in: FLAIRS Conference (2005)
Keyphrases
- constraint satisfaction problems
- combinatorial problems
- partial assignment
- constraint satisfaction
- decomposition methods
- np complete
- solution space
- constraint programming
- dynamic constraint satisfaction problems
- databases
- solving constraint satisfaction problems
- constraint problems
- constraint solving
- benchmark problems
- search space
- random instances
- optimal solution
- genetic algorithm
- data mining