Decomposing utility functions in Bounded Max-Sum for distributed constraint optimization

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/27089

dc.contributor	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor	Universitat Politècnica de Catalunya. LOGPROG - Lògica i Programació
dc.contributor.author	Rollón Rico, Emma
dc.contributor.author	Larrosa Bondia, Francisco Javier
dc.date	2014
dc.identifier.citation	Rollón, E.; Larrosa, J. Decomposing utility functions in Bounded Max-Sum for distributed constraint optimization. A: International Conference on Principles and Practice of Constraint Programming. "Principles and Practice of Constraint Programming: 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014: proceedings". Lyon: Springer, 2014, p. 646-654.
dc.identifier.citation	978-3-319-10427-0
dc.identifier.citation	10.1007/978-3-319-10428-7_47
dc.identifier.uri	http://hdl.handle.net/2117/27089
dc.language.iso	eng
dc.publisher	Springer
dc.relation	http://link.springer.com/chapter/10.1007/978-3-319-10428-7_47
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject	Constraint programming (Computer science)
dc.subject	Approximation theory
dc.subject	Graphical model
dc.subject	Approximate inference
dc.subject	Guaranteed approximation ratio
dc.subject	Programació per restriccions (Informàtica)
dc.subject	Aproximació, Teoria de l'
dc.title	Decomposing utility functions in Bounded Max-Sum for distributed constraint optimization
dc.type	info:eu-repo/semantics/submittedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.abstract	Bounded Max-Sum is a message-passing algorithm for solving distributed Constraint Optimization Problems (DCOP) able to compute solutions with a guaranteed approximation ratio. In this paper we show that the introduction of an intermediate step that decomposes functions may significantly improve its accuracy. This is especially relevant in critical applications (e.g. automatic surveillance, disaster response scenarios) where the accuracy of solutions is of vital importance.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author