Mostrar el registro sencillo del ítem

dc.contributor.author	Barber Sanchís, Federico	es_ES
dc.contributor.author	Salido Gregorio, Miguel Angel	es_ES
dc.date.accessioned	2013-05-17T08:36:44Z
dc.date.available	2013-05-17T08:36:44Z
dc.date.issued	2013-05-17
dc.identifier.uri	http://hdl.handle.net/10251/28918
dc.description	Technical Report	es_ES
dc.description.abstract	Many real-world problems in Artificial Intelligence (AI) as well as in other areas of computer science and engineering can be efficiently modeled and solved using constraint programming techniques. In many real-world scenarios the problem is partially known, imprecise, and dynamic such that some effects of actions are undesired and/or several un-foreseen incidences or changes can occur. Whereas expressivity, efficiency, and optimality have been the typical goals in the area, there are several issues regarding robustness that have a clear relevance in dynamic Constraint Satisfaction Problems (CSP). However, there is still no clear and common definition of robustness-related concepts in CSPs. In this paper, we propose two clearly differentiated definitions for robustness and stability in CSP solutions. We also introduce the concepts of recoverability and reliability, which arise in temporal CSPs. All these definitions are based on related well-known concepts, that are addressed in engineering and other related areas.	es_ES
dc.format.extent	19	es_ES
dc.language	Inglés	es_ES
dc.publisher	Universitat Politècnica de València	es_ES
dc.rights	Reconocimiento - No comercial (by-nc)	es_ES
dc.subject	Robustness	es_ES
dc.subject	Stability	es_ES
dc.subject	Dynamicity	es_ES
dc.subject	Constraint satisfaction problems	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, Stability, Recoverability and Reliability in CSP	es_ES
dc.type	Informe	es_ES
dc.rights.accessRights	Abierto	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	Barber Sanchís, F.; Salido Gregorio, MA. (2013). Robustness, Stability, Recoverability and Reliability in CSP. http://hdl.handle.net/10251/28918	es_ES



Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

• Informes técnicos de investigación DSIC-IA-PS [2]
  IA-PS: Inteligencia Artificial, Planificacion y Scheduling

Mostrar el registro sencillo del ítem