Speeding up distributed pseudo-tree optimization procedures with cross edge consistency to solve DCO...
Speeding up distributed pseudo-tree optimization procedures with cross edge consistency to solve DCOPs
About this item
Full title
Author / Creator
Publisher
New York: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
The Distributed Pseudo-tree Optimization Procedure (DPOP) is a well-known message passing algorithm that provides optimal solutions to Distributed Constraint Optimization Problems (DCOPs) in cooperative multi-agent systems. However, the traditional DCOP formulation does not consider constraints that must be satisfied (hard constraints), rather it c...
Alternative Titles
Full title
Speeding up distributed pseudo-tree optimization procedures with cross edge consistency to solve DCOPs
Authors, Artists and Contributors
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2487630355
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2487630355
Other Identifiers
ISSN
0924-669X
E-ISSN
1573-7497
DOI
10.1007/s10489-020-01860-8
