Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/133249
COMPARTIR / EXPORTAR:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | A Max-SAT-Based Approach to Constructing Optimal Covering Arrays |
Autor: | Ansotegui, Carlos; Izquierdo, Idelfonso; Manyà, Felip CSIC ORCID ; Torres-Jimenez, Jose | Palabras clave: | MaxSAT Optimization Covering arrays Combinatorial designs |
Fecha de publicación: | 23-oct-2013 | Editor: | IOS Press | Citación: | Artificial Intelligence Research and Development - Proceedings of the 16th International Conference of the Catalan Association for Artificial Intelligence, Vic, Catalonia, Spain, October 23-25, 2013. Frontiers in Artificial Intelligence and Applications, vol. 256, 2013, pp. 51-59 | Resumen: | This paper investigates a new exact method for constructing optimal covering arrays based on first encoding the problem as a Partial MaxSAT instance, and then solving the resulting instance with a state-of-the-art MaxSAT solver. To this end, we define an original MaxSAT encoding for covering arrays, and report on the experimentation performed to evaluate our MaxSAT-based approach. The obtained results indicate that MaxSAT is a good alternative for constructing optimal covering arrays, and it is worth to further investigate this new research direction in the area of combinatorial designs. © 2013 The authors and IOS Press. All rights reserved. | URI: | http://hdl.handle.net/10261/133249 | DOI: | 10.3233/978-1-61499-320-9-51 | Identificadores: | doi: 10.3233/978-1-61499-320-9-51 issn: 09226389 isbn: 978-161499319-3 |
Aparece en las colecciones: | (IIIA) Comunicaciones congresos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
accesoRestringido.pdf | 15,38 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
Page view(s)
205
checked on 17-abr-2024
Download(s)
53
checked on 17-abr-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.