首页> 外文会议>International Conference on Principles and Practice of Constraint Programming >Distributed Constraint Satisfaction with Cooperating Asynchronous Solvers
【24h】

Distributed Constraint Satisfaction with Cooperating Asynchronous Solvers

机译:与合作异步求解器的分布式约束满意度

获取原文

摘要

A Constraint Satisfaction Problem (CSP) is to find an assignment to a set of variables that is consistent wrt. a set of constraints over these variables. CSPs frequently arise in applications of distributed artificial intelligence and may often not be solved by a centralized constraint solver for privacy or security reasons. In this distributed case (DCSP) constraints and variables are distributed among multiple automated agents.
机译:约束满足问题(CSP)是找到一组一致WRT的变量的分配。在这些变量上的一组约束。 CSP经常出现在分布式人工智能的应用中,并且可以通过集中约束求解器来解决隐私或安全原因。在该分布式案例中(DCSP)约束和变量分布在多个自动代理之间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号