Research map / Learning theory and algorithms / Combinatorial and search optimization
CoCoA: A Non-Iterative Approach to a Local Search (A)DCOP Solver
Cornelis Jan van Leeuwen, Przemyslaw Pawelczak
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 |
|---|---|---|---|
| add unique-first assignment strategy (ablation) | CoCoA · Graph coloring (500 nodes) | solution cost: 183 -> 147 | Improved |
| add unique-first assignment strategy (ablation) | CoCoA · Graph coloring (500 nodes) | messages: 8827 -> 15402 | Hurt |
| add unique-first assignment strategy (ablation) | CoCoA · Asymmetric scale-free ADCOP | solution cost: 29316 -> 27426 | Improved |
| add unique-first assignment strategy (ablation) | CoCoA · Sensor planning | solution cost: 2365 -> 2365 | No clear effect |
| non-iterative CoCoA vs iterative DSA on graph coloring | CoCoA UF · Graph coloring (500 nodes) | solution cost: 129 -> 147 | Hurt |
| non-iterative CoCoA UF vs DSA on graph coloring | CoCoA UF · Graph coloring (500 nodes) | running time (s): 18.9 -> 0.8 | Improved |
| CoCoA UF vs MCS-MGM on asymmetric problems | CoCoA UF · Asymmetric scale-free ADCOP | solution cost: 22200 -> 27426 | Hurt |
| CoCoA UF vs MCS-MGM on asymmetric problems | CoCoA UF · Asymmetric scale-free ADCOP | messages: 1349161 -> 6873 | Improved |
| CoCoA vs MCS-MGM on sensor planning | CoCoA · Sensor planning | solution cost: 2379 -> 2365 | Improved |
Closest papers by meaning
- Pretrained Cost Model for Distributed Constraint Optimization Problems (AAAI 2022 · similarity 0.89)
- A Particle Swarm Based Algorithm for Functional Distributed Constraint Optimization Problems (AAAI 2020 · similarity 0.88)
- HS-CAI: A Hybrid DCOP Algorithm via Combining Search with Context-Based Inference (AAAI 2020 · similarity 0.88)
- A Generic Approach to Accelerating Belief Propagation Based Incomplete Algorithms for DCOPs via a Branch-and-Bound Technique (AAAI 2019 · similarity 0.87)
- CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization (AAAI 2026 · similarity 0.82)
- Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization (ICML 2025 · similarity 0.82)
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.
