Solving the General Consistent Labeling (or Constraint Satisfaction) Problem: Two Algorithms and Their Expected Complexities.
Bernard NudelPublished in: AAAI (1983)
Keyphrases
- constraint satisfaction problems
- pseudo boolean optimization
- problems in artificial intelligence
- constraint problems
- tractable subclasses
- constraint satisfaction
- graph coloring problems
- backtracking algorithm
- constraint propagation
- tractable classes
- consistent labeling
- constraint graph
- special case
- decomposition methods
- distributed constraint satisfaction
- non binary
- finding optimal solutions
- constraint solving
- object tracking
- computer vision
- reasoning problems
- combinatorial problems
- multi camera
- constraint programming
- combinatorial optimization
- np complete
- np hard
- lower bound
- partial constraint satisfaction
- search algorithm
- optimal solution