Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/133712COMPARTIR / EXPORTAR:
 SHARE
BASE
|
|
| Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
| Título: | On Binary Max-Sum and Tractable HOPs |
Autor: | Pujol-Gonzalez, Marc; Cerquides, Jesús CSIC ORCID ; Escalada-Imaz, Gonzalo CSIC ORCID ; Meseguer, Pedro CSIC ORCID ; Rodríguez-Aguilar, Juan Antonio CSIC ORCID CVN | Fecha de publicación: | 12-dic-2013 | Citación: | Proceedings of the Eleventh European Workshop on Multi-Agent Systems (EUMAS 2013) Toulouse, France, December 12-13, 2013. | Resumen: | The Max-Sum message-passing algorithm has been used to approximately solve several unconstrained optimization problems, specially in the distributed context. In general, the complexity of computing messages is exponential. However, if the problem is modeled using the so called Tractable HOPs (THOPs), binary MaxSum's messages can be computed in polynomial time. In this paper we review existing THOPs, and present new ones, aiming at providing an updated view of efficient message computation. | URI: | http://hdl.handle.net/10261/133712 | Identificadores: | issn: 1613-0073 |
| Aparece en las colecciones: | (IIIA) Comunicaciones congresos |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
| WsEUMAS13.pdf | 105,46 kB | Unknown | Visualizar/Abrir |
CORE Recommender
Page view(s)
147
checked on 18-abr-2024
Download(s)
332
checked on 18-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.