- -

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 simple item record

Files in this item

dc.contributor.author Climent Aunés, Laura Isabel es_ES
dc.contributor.author Salido Gregorio, Miguel Angel es_ES
dc.contributor.author Barber Sanchís, Federico es_ES
dc.date.accessioned 2018-07-16T06:43:43Z
dc.date.available 2018-07-16T06:43:43Z
dc.date.issued 2012 es_ES
dc.identifier.issn 1349-4198 es_ES
dc.identifier.uri http://hdl.handle.net/10251/105809
dc.description.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 of the problem may change during its execution. These problems can be modeled as dynamic constraint satisfaction problems (DynCSPs), which are an important extension of the CSPs. In this paper, we focus our attention on the concept of robustness. Our aim is to find robust solutions which have a high probability of remaining valid faced with possible future changes in the constraints of the problem. We introduce the informed DynCSPs, proposing an approach to solve them by the weighted CSP (WCSP) modeling. Thus, the best solution for the modeled WCSP will be a robust solution for the original DynCSP. Furthermore, this technique has been evaluated in order to analyze the robustness of the solutions obtained. es_ES
dc.description.sponsorship This work has been partially supported by the research projects TIN2010-20976-C02-01 (Min. de Ciencia e Innovación, Spain) and P19/08 (Min. de Fomento, Spain-FEDER), and the fellowship program FPU. es_ES
dc.language Inglés es_ES
dc.publisher ICIC International es_ES
dc.relation MICINN/TIN2010-20976-C02-01 es_ES
dc.relation FOMENTO-FEDER/P19/08 es_ES
dc.relation.ispartof International Journal of Innovative Computing Information and Control es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Constraint satisfaction problem es_ES
dc.subject Robustness es_ES
dc.subject Dynamic constraints es_ES
dc.subject.classification CIENCIAS DE LA COMPUTACION E INTELIGENCIA ARTIFICIAL es_ES
dc.subject.classification LENGUAJES Y SISTEMAS INFORMATICOS es_ES
dc.title Robustness in Dynamic Constraint Satisfaction Problems es_ES
dc.type Artículo es_ES
dc.rights.accessRights Cerrado es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació es_ES
dc.description.bibliographicCitation 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 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://www.ijicic.org/ijicic-11-01011.pdf es_ES
dc.description.upvformatpinicio 2513 es_ES
dc.description.upvformatpfin 2532 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 8 es_ES
dc.description.issue 3 es_ES
dc.relation.pasarela S\198828 es_ES
dc.contributor.funder Ministerio de Ciencia e Innovación es_ES
dc.contributor.funder Ministerio de Fomento es_ES
dc.contributor.funder European Regional Development Fund es_ES


This item appears in the following Collection(s)

Show simple item record