English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/133712
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

On Binary Max-Sum and Tractable HOPs

AuthorsPujol-Gonzalez, Marc; Cerquides, Jesús ; Escalada-Imaz, Gonzalo ; Meseguer, Pedro ; Rodríguez-Aguilar, Juan Antonio
Issue Date12-Dec-2013
CitationProceedings of the Eleventh European Workshop on Multi-Agent Systems (EUMAS 2013) Toulouse, France, December 12-13, 2013.
AbstractThe 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.
URIhttp://hdl.handle.net/10261/133712
Identifiersissn: 1613-0073
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
WsEUMAS13.pdf105,46 kBUnknownView/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.