.png){kind=icon}
返回
Multi-variable distributed backtracking with sessions
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-014-0532-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Constraint Satisfaction Problem (CSP) formalism is used to represent many combinatorial decision problems instances simply and efficiently. However, many such problems cannot be solved on a single, centralized computer for various reasons (e.g., their excessive size or privacy). The Distributed CSP (DisCSP) extends the CSP model to allow such combinatorial decision problems to be modelled and handled. In this paper, we propose a complete DisCSP-solving algorithm, called Distributed Backtracking with Sessions (DBS), which can solve DisCSP so that each agent encapsulates a whole complex problem with many variables and constraints. We prove that the algorithm is sound and complete, and generates promising experimental results.
Keyword:
Multi-agent system
Distributed CSP
Sessions
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
暂无机构信息
引用论文
Constraint satisfaction as a tool for modeling and checking feasibility of multiagent commitments.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏分享收藏MINIMIZING CONFLICTS - A HEURISTIC REPAIR METHOD FOR CONSTRAINT SATISFACTION AND SCHEDULING PROBLEMS
OAAI
OAAI分享收藏
查看更多内容