Accelerating Recursive Partition-Based Causal Structure Learning

no code implementations • 23 Feb 2021 • Md. Musfiqur Rahman, Ayman Rasheed, Md. Mosaddek Khan, Mohammad Ali Javidian, Pooyan Jamshidi, Md. Mamun-or-Rashid

This paper proposes a generic causal structure refinement strategy that can locate the undesired relations with a small number of CI-tests, thus speeding up the algorithm for large and complex problems.

Causal Discovery Decision Making +1

Improving Solution Quality of Bounded Max-Sum Algorithm to Solve DCOPs involving Hard and Soft Constraints

no code implementations • 2 Dec 2020 • Md. Musfiqur Rahman, Mashrur Rashik, Md. Mamun-or-Rashid, Md. Mosaddek Khan

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

no code implementations • 14 Sep 2019 • Mashrur Rashik, Md. Musfiqur Rahman, Md. Mamun-or-Rashid, Md. Mosaddek Khan

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.

Scheduling