atlas

Research map / Graph learning / Graph algorithms and clustering

Pretrained Cost Model for Distributed Constraint Optimization Problems

AAAI 2022 · Graph learning › Graph algorithms and clustering · approach: Neural combinatorial optimization on graphs · 4 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 GAT-PCM to repair assignments without relaxing constraints in DLNSDLNS · Random DCOPs and scale-free networksnormalized anytime costHelped
Use GAT-PCM to repair assignments without relaxing constraints in DLNSDLNS · Small grid networksnormalized anytime costHurt
Use GAT-PCM to repair assignments without relaxing constraints in DLNSDLNS · Grid networks with grid size higher than 14normalized anytime costHelped
Use GAT-PCM predicted costs for domain orderingPT-ISBB · Random DCOPs and scale-free networkssimulated runtimeHelped
Use GAT-PCM to guide DLNS repair instead of existing heuristicsDLNS · Random DCOPs with |I|=1000, p1=0.005, d=3solution qualityHelped

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