Research map / Learning theory and algorithms / Combinatorial and search optimization
A Generic Approach to Accelerating Belief Propagation Based Incomplete Algorithms for DCOPs via a Branch-and-Bound Technique
Ziyu Chen, Xingqiong Jiang, Yanchen Deng, Dingding Chen, Zhongshi He
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use FDSP instead of GDP pruning | Max-Sum · varT 0.1-0.9 | % of search space pruned: 87% -> 97% | Improved |
| increase variable tightness varT for GDP | GDP · varT >= 0.5 | % of search space pruned | Hurt |
| increase variable tightness varT for FDSP | FDSP · varT 0.1-0.9 | % of search space pruned | No clear effect |
| use FDSP instead of GDP in sparse graphs | Max-Sum · max arity 2-7 | % of search space pruned: 80% -> 99% | Improved |
| use FDSP instead of GDP in dense graphs | Max-Sum · max arity 2-7 | % of search space pruned: 36% -> 99% | Improved |
| use FDSP instead of GDP in sparse graphs | Max-Sum · function-nodes 10-100 | % of search space pruned: 88% -> 97% | Improved |
| use FDSP instead of GDP in dense graphs | Max-Sum · function-nodes 10-100 | % of search space pruned: 55% -> 97% | Improved |
| use FDSP instead of GDP at large domain sizes | Max-Sum · domain size 2-7 | runtime | Improved |
| add FDSP to Max-Sum ADVP | Max-Sum ADVP · domain size 2-7, sparse and dense | runtime | Improved |
Closest papers by meaning
- HS-CAI: A Hybrid DCOP Algorithm via Combining Search with Context-Based Inference (AAAI 2020 · similarity 0.89)
- Pretrained Cost Model for Distributed Constraint Optimization Problems (AAAI 2022 · similarity 0.87)
- CoCoA: A Non-Iterative Approach to a Local Search (A)DCOP Solver (AAAI 2017 · similarity 0.87)
- A Particle Swarm Based Algorithm for Functional Distributed Constraint Optimization Problems (AAAI 2020 · similarity 0.87)
- GDBA Revisited: Unleashing the Power of Guided Local Search for Distributed Constraint Optimization (AAAI 2026 · similarity 0.86)
- Relaxing the Additivity Constraints in Decentralized No-Regret High-Dimensional Bayesian Optimization (ICLR 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
