Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/344786
COMPARTIR / EXPORTAR:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | Pseudo-Tree Search with Soft Constraints |
Autor: | Larrosa, Javier; Meseguer, Pedro CSIC ORCID ; Sánchez-Fibla, Martí | Fecha de publicación: | 2002 | Editor: | IOS Press | Citación: | ECAI 2002: 15th European Conference on Artificial Intelligence, July 21-26, 2002, Lyon France: Including Prestigious Applications of Intelligent Systems (PAIS 2002). Proceedings: 131-135 (2002) | Resumen: | Pseudo-tree search is a well known algorithm for CSP solving. It exploits the problem structure to detect independent subproblems that are solved separately. Its main advantage is that its run time complexity is bounded by a problem structural parameter. In this paper, we extend this idea to soft constraint problems. We show that the same general principles apply to this domain. However, a naive implementation is not competitive with state-of-the-art algorithms, because solving independent problems separately may yield a poor algorithmic efficiency due to loose upper bounds. We introduce PT-BB, a branch-and-bound algorithm that performs efficient pseudo-tree search. Its main feature is the use of local upper bounds which can improve over loose global upper bounds. We also show that PT-BB combines nicely with russian doll search (RDS), producing an interesting algorithm. | Descripción: | Trabajo presentado en la 15th European Conference on Artificial Intelligence (ECAI'02), Lyon France July 21 - 26, 2002. | URI: | http://hdl.handle.net/10261/344786 | ISBN: | 1-58603-257-7 |
Aparece en las colecciones: | (IIIA) Libros y partes de libros |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
2002-ECAI.pdf | 121,43 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
Page view(s)
18
checked on 30-abr-2024
Download(s)
2
checked on 30-abr-2024
Google ScholarTM
Check
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.