首页 | 本学科首页   官方微博 | 高级检索  
     

算法工程的思想、方法与工具——以SAT算法为研究实例
引用本文:焦加麟 韩晓峰 徐良贤. 算法工程的思想、方法与工具——以SAT算法为研究实例[J]. 计算机科学, 2003, 30(9): 11-13
作者姓名:焦加麟 韩晓峰 徐良贤
作者单位:上海交通大学计算机科学与工程系,上海,200030
摘    要:The recently emerging idea of Algorithm Engineering in the community of Computer Science is about how to engineer computer algorithms by integrating the design, analysis, implementation, experimental testing, refine-ment, etc. of them, aiming at improving their runtime performance.In this paper, we try to develop the main idea of the theory and methodology of algorithm engineering, and givean introduction to some useful tools. In order to concretize our discussion and illustrate the effectiveness of algorithm engineering, we will base our study on the engineering of SAT algorithms. According to the rules and methodologies of algorithm engineering we have learned, we implement a simple but efficient SAT solver, Quick SAT, as a testbed.Although we haven‘t utilized most of the advanced techniques used in modern SAT solvers, the result of experimental comparison shows that Quick SAT is close in performance to zChaff, one of the leading SAT solvers in the world to-day.

关 键 词:算法工程 SAT算法 研究 计算机

The Theory,Methodology and Tools of Algorithm Engineering:A Case Study with SAT Algorithms
JIAO Jia-Lin HAN Xiao-Feng XU Liang-Xian. The Theory,Methodology and Tools of Algorithm Engineering:A Case Study with SAT Algorithms[J]. Computer Science, 2003, 30(9): 11-13
Authors:JIAO Jia-Lin HAN Xiao-Feng XU Liang-Xian
Abstract:The recently emerging idea of Algorithm Engineering in the community of Computer Science is about how to engineer computer algorithms by integrating the design, analysis, implementation, experimental testing, refinement, etc. of them, aiming at improving their runtime performance.In this paper, we try to develop the main idea of the theory and methodology of algorithm engineering, and give an introduction to some useful tools. In order to concretize our discussion and illustrate the effectiveness of algorithm engineering, we will base our study on the engineering of SAT algorithms. According to the rules and methodologies of algorithm engineering we have learned, we implement a simple but efficient SAT solver, QuickSAT, as a testbed. Although we haven't utilized most of the advanced techniques used in modern SAT solvers, the result of experimental comparison shows that QuickSAT is close in performance to zChaff, one of the leading SAT solvers in the world today.
Keywords:Computer algorithm   Algorithm engineering   SAT
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号