- -

A FILTERING TECHNIQUE TO ACHIEVE 2-CONSISTENCY IN CONSTRAINT SATISFACTION PROBLEMS

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A FILTERING TECHNIQUE TO ACHIEVE 2-CONSISTENCY IN CONSTRAINT SATISFACTION PROBLEMS

Show full item record

Arangú Lobig, MA.; Salido, MA.; Barber Sanchís, F. (2012). A FILTERING TECHNIQUE TO ACHIEVE 2-CONSISTENCY IN CONSTRAINT SATISFACTION PROBLEMS. International Journal of Innovative Computing Information and Control. 8(6):3891-3906. http://hdl.handle.net/10251/105823

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

Files in this item

Item Metadata

Title: A FILTERING TECHNIQUE TO ACHIEVE 2-CONSISTENCY IN CONSTRAINT SATISFACTION PROBLEMS
Author: Arangú Lobig, Marlene Alicia Salido, Miguel A. Barber Sanchís, Federico
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] Arc-Consistency algorithms are the most commonly used ltering techniques to prune the search space in Constraint Satisfaction Problems (CSPs). 2-consistency is a similar technique that guarantees that any instantiation ...[+]
Subjects: Constraint satisfaction problems , Consistency techniques , 2-consistency
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-02011.pdf
Project ID:
info:eu-repo/grantAgreement/MICINN//TIN2010-20976-C02-01/ES/TECNICAS PARA LA EVALUACION Y OBTENCION DE SOLUCIONES ESTABLES Y ROBUSTAS EN PROBLEMAS DE OPTIMIZACION Y SATISFACCION DE RESTRICCIONES/
Thanks:
This work has been partially supported by the research project TIN2010- 20976-C02-01 (Min. de Educacion y Ciencia, Spain-FEDER).
Type: Artículo

recommendations

 

This item appears in the following Collection(s)

Show full item record