arXiv (All)
open access
Dynamic Conflict Clustering with Lightweight Learning and Strategic Repair for Distributed Constraint Satisfaction
Distributed Constraint Satisfaction Problems (DCSPs) model distributed decision-making in multi-agent systems, where agents assign values to local variables while satisfying shared constraints. However, many DCSP solvers still rely on broad, repeated peer-to-peer communication and are largely reacti
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- SeedFlood: A Step Toward Scalable Decentralized Fine-Tuning of LLMs#1156287
- Cooperative Multi-Agent Assignment over Stochastic Graphs via Constrained Reinforcement Learning#1109755
- GraphMAS: A Systematic Benchmark of Multi-Agent Coordination for Graph Learning#1144944
- Resolving Conflicts Where and When They Arise: Reactive Composition of Multi-Goal Behavior#1233865
- Improving Constraint Models with LLM Agents#1052266
Record · ID 1326908
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive