期刊文献+

并行蚁群算法求解加权MAX-SAT 被引量:4

Parallel ant colony algorithm for weighted MAX-SAT
下载PDF
导出
摘要 为了使得算法对蚁群进化的控制更加直接、算法更加高效,针对加权MAX-SAT的特点,以重离散化方式简化蚁群算法模型,提出取值概率的概念,并以之替换传统蚁群算法中信息素,最后对该算法作并行化改进。实验结果表明,得到的基于改进后并行化的蚁群算法更具有效性,搜索时间明显降低,取得了较好的加速比和效率。 For making the algorithm more direct control,the algorithm more efficient,this paper weighted the characterisics of the MAX-SAT,simplified discrete approach to re-model of ant colony algorithm and proposed the concept of probability values,replaced the traditional elements of pheromone ant colony algorithm,finally made parallel improvements of the algorithm.Experimental results show that the new algorithm is more parallel efficiency,reduces the search time significantly,and achieves good speedup and efficiency.
出处 《计算机应用研究》 CSCD 北大核心 2012年第1期49-51,共3页 Application Research of Computers
基金 国家自然科学基金资助项目(50605010) 广西教育厅科研资助项目(200911LX15) 广西大学科研资助项目(XJZ110585)
关键词 蚁群算法 加速比 并行 最大化可满足性问题(MAX-SAT) 加权MAX-SAT 多核 ant colony algorithm speedup parallel maximum satisfiability problem(MAX-SAT) weighted MAX-SAT multi-core
  • 相关文献

参考文献8

  • 1BORCHERS B, FURMAN J. A two-phase exact algorithm for MAXSAT and weighted MAX-SAT problems[J]. Journal of Combinatorial Optimization, 1999,2(4) :299-306.
  • 2De GIVRY S, LARROSA J, MESEGUER P, et al. Solving MAX-SAT as weighted CSP[ C ]//Principles and Practice of Constraint Programming. Berlin : Springer,2003:363-376.
  • 3ALSINEL T, MANYA F, PLANES J. An efficient solver for weighted MAX-SAT[ J ]. Journal of Combinatorial Optimization, 2008,43 ( 1 ) :61-73.
  • 4LIN Han, SU Kai-le. Exploiting inference rules to compute lower bounds for MAX-SAT solving [ C ]//Proc of the 20th International Joint Conference on Artifical Intelligence. San Francisco: Morgan Kaufmann Publishers,2007 : 2334-2339.
  • 5ELLABIB I, CALAMAI P, BASIR O. Exchange strategies for multiple ant colony system[ J]. Information Sciences,2007,177 (5) : 1248- 1264.
  • 6MANFRIN M, BIRATTARI M, STUTZLE T, et al. Parallel ant colony optimization for the traveling salesman problem [ C]//Proc of the 5 th International Workshop on Ant Colony Optimization and Swarm Intelligence. Berlin : Springer, 2006 : 224- 234.
  • 7林奋,周育人.求解可满足问题的改进的蚁群算法[J].计算机工程与应用,2009,45(3):42-44. 被引量:6
  • 8Walksat Home Page. Walksat[ EB/OL]. http://www, cs. rochester. edu/-kautz,/walksat/,2009.

二级参考文献11

共引文献5

同被引文献30

  • 1凌应标,吴向军,姜云飞.基于子句权重学习的求解SAT问题的遗传算法[J].计算机学报,2005,28(9):1476-1482. 被引量:15
  • 2李阳阳,焦李成.求解SAT问题的量子免疫克隆算法[J].计算机学报,2007,30(2):176-183. 被引量:45
  • 3鲁剑峰.访问控制策略的安全与效用优化方法研究[D].武汉:华中科技大学,2010.
  • 4MAX P, LI R X, LU Z D, et al. Specifying and enforcing the princi- ple of least privilege in role-based access control[ J]. Concurrency and Computation: Practice and Experience, 2011, 23 (12) : 1313 - 1331.
  • 5FU Z H, MALIK S. On solving the partial MAX-SAT problem[ C]// SAT 2006: Proceedings of the 9th International Conference on the Theory and Application of Satisfiability Testing. Seattle: IEEE Press, 2006:252 -265.
  • 6LI N H, TRIPUNITARA M V, BIZRI Z. On mutually-exclusive roles and separation of duty[ J]. ACM Transactions on Information and System Security, 2007, 10(2) : 42 - 51.
  • 7ZHANG Y, JOSHI J B D. UAQ: a framework for user authorization query processing in RBAC extended with hybrid hierarchy and con- straints[ C] // Proceedings of the 13th ACM Symposium on Aceess Control Models and Technologies. New York: ACM Press, 2008:83 -92.
  • 8WICKRAMAARACHCHI G T, QARDAJI W H, LI N H. An effi- cient framework for user authorization queries in RBAC systems [ C]/,/Proceedings of the 14th ACM Symposium on Access Control Models and Technologies. New York: ACM Press, 2009:23 -32.
  • 9ARGELICH J, CABISCOL A, LYNCE I, et al. Regular encodings from MAX-CSP into partial MAX-SAT[ C]// Proceedings of the 39th Intemational Symposium on Multiple-Valued Logics. Piscat- away: IEEE Press, 2009:196 - 202.
  • 10KOSHIMURA M, ZHANG T, FUJITA H, et al. QMaxSAT: a par- tial MAX-SAT solver[ J]. Journal on Satisfiability, Boolean Modeling and Computation, 2012, 8(2) : 95 - 100.

引证文献4

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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