Search Results for author:
Found 2 papers, 0 papers with code
Improving Solution Quality of Bounded Max-Sum Algorithm to Solve DCOPs involving Hard and Soft Constraints
In particular, BMS algorithm is able to solve problems of this type having large search space at the expense of low computational cost.
Speeding Up Distributed Pseudo-tree Optimization Procedure with Cross Edge Consistency to Solve DCOPs
Distributed Pseudo-tree Optimization Procedure (DPOP) is a well-known message passing algorithm that has been used to provide optimal solutions of Distributed Constraint Optimization Problems (DCOPs) -- a framework that is designed to optimize constraints in cooperative multi-agent systems.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
