期刊文献+

用迭代多代理方法解决CSP问题

The Iterative Multi-Agent Method for Solving Constraint Satisfaction Problem
下载PDF
导出
摘要 主要介绍了一种包含独立代理点和部分解集合的解决方法—迭代多代理方法(IMA)。并用该方法来解决CSP问题。另外给出了用IMA方法解决CSP问题的一个实例,证明了IMA方法可以不受软件和硬件缺点的影响,并且该方法大大改进了在解决满意约束问题时的查找速度。 This paper introduces a problem solving method called Iterative Multi -Agent method ( IMA), involving independent agents and a set of partial solutions. And use it solve constraint satisfaction problem (CSP). In addition, this paper gives an example of CSP solving, and show that the IMA method is able to not be influenced by hardware and software faults and considerably improves the search speed in solving the example CSP.
作者 胡慧
出处 《微处理机》 2009年第1期120-123,127,共5页 Microprocessors
关键词 多代理 迭代多代理 约束满意问题 分段方法 Multi - Agent Iterative Multi - Agent Constraint Satisfaction Problem Decentralized method
  • 相关文献

参考文献6

  • 1P S Eaton, E C Freuder. Agent Cooperation Can Compensate For Agent Ignorance In Constraint Satisfaction[ M]. AAAI -96 Workshop on Agent Modeling, 1996.
  • 2J Knopp, M Reich. A Workpool Model for Parallel Computing [ M ]. Proceedings of the First International Workshop on High Level Programming Models and Supportive Environments, 1996.
  • 3B A Nadel. Constraint satisfaction algorithms [ J ]. Computational Intelligence, 1998 ( 5 ) : 0.246 - 258.
  • 4B J Nelson. Fault -Tolerant Computing: Fundamental Concepts[ J ]. IEEE Computer, July 1990 ( 23 ) : 378 - 396.
  • 5A S Tanenbaum. Distributed Operating Systems [ M ]. Prentice - Hall International, 1995.
  • 6M Yokoo, E H Durfee, T Ishida, K Kuwabara. The Distributed Constraint Satisfaction Problem: Formalization and Algorithms [ J ]. IEEE Transactions on Knowledge and Data Engineering, 1998,10 (5) : 127 - 159.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部