AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

A Particle Swarm Based Algorithm for Functional Distributed Constraint Optimization Problems

Moumita Choudhury, Saaduddin Mahmud, Md. Mosaddek Khan

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Decision-focused optimization · 28 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use PFD instead of HCMSF-DCOP with random sparse graphs, varying agent count · Random sparse graphsaverage solution costImproved
Use PFD instead of HCMSF-DCOP with sparse graphs over iterations · Random sparse graphs, 50 agentssolution costMixed
Use PFD instead of HCMSF-DCOP with scale-free graphs · Random scale-free graphsaverage solution costMixed
Use PFD instead of HCMSF-DCOP with dense graphs · Random dense graphssolution costImproved
Use PFD instead of HCMS and AF-DPOPF-DCOP with random trees · Random treesaverage solution costImproved
Scale AF-DPOP to at least 20 agentsAF-DPOP on random sparse graphs · Random sparse graphsmemory use: no. of agents ≥ 20Hurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy