Robustness and stability in dynamic constraint satisfaction problems
Constraint programming is a paradigm wherein relations between variables are stated in the form of constraints. It is well-known that many real life problems can be modeled as Constraint Satisfaction Problems (CSPs). Much effort has been spent to increase the efficiency of algorithms for solving CSP...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Universitat Politècnica de València
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10251/34785 |