- -

Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings

Show full item record

Climent Aunes, LI.; Wallace, RJ.; Salido Gregorio, MA.; Barber, F. (2013). Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings. Artificial Intelligence Review. 1-26. doi:10.1007/s10462-013-9420-0

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

Files in this item

Item Metadata

Title: Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings
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:
Constraint programming is a paradigm wherein relations between variables are stated in the form of constraints. Many real life problems come from uncertain and dynamic environments, where the initial constraints and ...[+]
Subjects: Robustness , Uncertainty , Dynamism · , Dynamic constraint satisfaction problems (DynCSPs)
Copyrigths: Reserva de todos los derechos
Source:
Artificial Intelligence Review. (issn: 0269-2821 )
DOI: 10.1007/s10462-013-9420-0
Publisher:
Springer Verlag (Germany)
Publisher version: http://link.springer.com/content/pdf/10.1007%2Fs10462-013-9420-0.pdf
Thanks:
This work has been partially supported by the research projects TIN2010-20976-C02-01 (Min. de Ciencia e Innovacion, Spain) and P19/08 (Min. de Fomento, Spain-FEDER), and the fellowship program FPU.
Type: Artículo

This item appears in the following Collection(s)

Show full item record