Anytime Algorithms for Maximal Constraint Satisfaction.
Ahmed SamehNoha KaptanPublished in: CAINE (2001)
Keyphrases
- constraint satisfaction
- anytime algorithms
- dynamic programming
- data streams
- real time systems
- heuristic search algorithms
- constraint satisfaction problems
- heuristic search
- solution quality
- optimal solution
- constraint relaxation
- constraint programming
- constraint propagation
- soft constraints
- anytime classification
- robust fault detection
- upper bound
- np hard
- neural network
- russian doll search
- arc consistency
- special case
- markov decision problems