.png){kind=icon}
返回
Asynchronous aggregation and consistency in distributed constraint satisfaction
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2004.10.003.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly, many of these tasks pose themselves in a distributed setting where variables and constraints are distributed among different agents. A variety of asynchronous search algorithms have been proposed for addressing this setting. We show how two techniques commonly used in centralized constraint satisfaction, value aggregation and maintaining arc consistency can be applied to increase efficiency in an asynchronous, distributed context as well, and report on experiments that quantify the gains. (C) 2004 Elsevier B.V. All rights reserved.
Keyword:
constraint satisfaction
multi-agent systems
distributed AI
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
Liver Kinase B1—A Potential Therapeutic Target in Hormone-Sensitive Breast Cancer in Older Women.png)
CancersOAAI
CancersIF0
OAAI分享收藏 没有更多内容
没有更多内容