- -

Robustness in Dynamic Constraint Satisfaction Problems

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Robustness in Dynamic Constraint Satisfaction Problems

Show full item record

Climent Aunes, LI.; Salido Gregorio, MA.; Barber Sanchís, F. (2012). Robustness in Dynamic Constraint Satisfaction Problems. International Journal of Innovative Computing Information and Control. 8(3):2513-2532. http://hdl.handle.net/10251/105809

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/105809

Files in this item

Item Metadata

Title: Robustness in Dynamic Constraint Satisfaction Problems
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Issued date:
Abstract:
[EN] Constraint programming is a successful technology for solving combinatorial problems modeled as constraint satisfaction problems (CSPs). Many real life problems are dynamic, which means that the initial description ...[+]
Subjects: Constraint satisfaction problem , Robustness , Dynamic constraints
Copyrigths: Cerrado
Source:
International Journal of Innovative Computing Information and Control. (issn: 1349-4198 )
Publisher:
ICIC International
Publisher version: http://www.ijicic.org/ijicic-11-01011.pdf
Type: Artículo

This item appears in the following Collection(s)

Show full item record