Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/138166
COMPARTIR / EXPORTAR:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | Removing Redundant Messages in N-ary BnB-ADOPT |
Autor: | Gutierrez, Patricia; Meseguer, Pedro CSIC ORCID | Palabras clave: | Redundant messages BnB-ADOPT DCOP Communication efficiency Distributed constraint optimizations Optimality |
Fecha de publicación: | 2012 | Editor: | Morgan Kaufmann | Citación: | Journal of Artificial Intelligence Research 45: 287- 304 (2012) | Resumen: | This note considers how to modify BnB-ADOPT, a well-known algorithm for optimally solving distributed constraint optimization problems, with a double aim: (i) to avoid sending most of the redundant messages and (ii) to handle cost functions of any arity. Some of the messages exchanged by BnB-ADOPT turned out to be redundant. Removing most of the redundant messages increases substantially communication efficiency: the number of exchanged messages is ¿in most cases¿ at least three times fewer (keeping the other measures almost unchanged), and termination and optimality are maintained. On the other hand, handling n-ary cost functions was addressed in the original work, but the presence of thresholds makes their practical usage more complex. Both issues ¿removing most of the redundant messages and efficiently handling n-ary cost functions¿ can be combined, producing the new version BnB-ADOPT+. Experimentally, we show the benefits of this version over the original one. | URI: | http://hdl.handle.net/10261/138166 | Identificadores: | issn: 1076-9757 |
Aparece en las colecciones: | (IIIA) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
accesoRestringido.pdf | 15,38 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
Page view(s)
190
checked on 24-abr-2024
Download(s)
76
checked on 24-abr-2024
Google ScholarTM
Check
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.