期刊文献+

一种新的用于布线的打破对称自适应流程

An advanced technique of symmetry-breaking for Boolean formulas
下载PDF
导出
摘要 介绍一种自适应流程,结合静态打破对称技术和动态打破对称技术,分析一个给定的布尔优化问题,并挑选最适于问题特点的打破对称技术。实验结果证明,当将这种技术用于布线时,它比纯粹的静态打破对称或动态打破对称在很多情况下可加快解决问题。 A new technique of dynamic symmetry-breaking was introduced and an adaptive flow was proposed which can analyze a given Boolean optimization problem and pick the symmetry-breaking technique that is the best suited to the problem characteristics. Preliminary experimental results show that this approach accelerates problem-solving in many cases compared with pure static symmetry-breaking and pure dynamic symmetry-breaking.
出处 《中南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2009年第S1期330-334,共5页 Journal of Central South University:Science and Technology
基金 江苏省自然科学基金资助项目(BK2007026) 江苏省"333高层次人才培养工程"专项基金资助项目(2007124)
关键词 布尔函数 整数线性规划 布线算法 对称 Boolean function integer linear programming routing algorithms symmetry
  • 相关文献

参考文献15

  • 1Nam G J,Aloul F,Sakallah K,et al.A comparative study of two Boolean formulations of FPGA detailed routing constraints. Proc ACM Int’l Symposium on Physical Design (ISPD’01) . 2004
  • 2Nam G J,Sakallah K,Rutenbar R A.A Boolean satisfiability-based incremental rerouting approach with application to FPGAs. Proc Design Automation&Test Europe (DATE’01) . 2001
  • 3Crawford J,Ginsberg M,Lucks E,et al.Symmetry-breaking predicates for search problems. Proceedings of the International Conference Principles of Knowledge Representation and Reasoning (KR) . 1996
  • 4Aloul F A,Markov I L,Sakallah K A.Shatter:Efficient symmetry-breaking for Boolean satisfiability. Design Automation Conference . 2003
  • 5Aloul F A,Ramani A,Shatter P B.Symmetry-breaking for pseudo-Boolean formulas. Proceedings of the ASP-DAC,Design Automation Conference Asia and South Pacific . 2004
  • 6Ramani A,Aloul F A,Markov I L.Dynamic symmetry-breaking for improved Boolean optimization. Proceedings of the2005Asia and South Pacific Design Automation Conference . 2005
  • 7McKay B.NAUTY User’s Guide,Version1.5. 1990Technical Report TRAS-90-02,Computer Science Department,Australian National University,ANU .
  • 8Darga P,Liffiton K,Sakallah K,et al.Exploiting structure in symmetry detection for CNF. Proceedings of Design Automation Conference(DAC) . 2004
  • 9DIMASC SAT benchmarks. ftp://Dimacs.rutgers.EDU/pub/challenge/sat/benchmarks/cnf . 1993
  • 10Nam G J,Sakallah K,Rutenbar R A.A Boolean satisfiability-based incremental rerouting approach with application to FPGAs. Proceedings of the Conference on Design,Automaton and Test in Europe (DATE’01) . 2001

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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