toward an automatic approach to greedy algorithms
文献类型：会议论文
| 作者 | Zheng Yujun ; Xue Jinyun ; Zuo Zhengkang |
| 出版日期 | 2009 |
| 会议名称 | 3rd International Workshop on Frontiers in Algorithmics |
| 会议日期 | JUN 20-23, |
| 会议地点 | Hefei, PEOPLES R CHINA |
| 关键词 | Combinatorial optimization problems PAR method problem singleton greedy algorithm |
| 页码 | 302-313 |
| 英文摘要 | The greedy approach is widely used for combinatorial optimization problems, but its implementation varies from problem to problem. In this paper we propose a mechanical approach for implementing greedy algorithmic programs. Using PAR, method, a problem can be continually partitioned into subproblems in smaller size based on the problem singleton and the maximum selector, and the greedy algorithm can be mechanically generated by combining the problem-solving sequences. Our structural model supports logical transformation from specifications to algorithmic programs by deductive inference; and thus significantly promotes the automation and reusability of algorithm design. |
| 收录类别 | ISTP,EI,ACM |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版者 | FRONTIERS IN ALGORITHMICS, PROCEEDINGS |
| 会议录出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| 语种 | 英语 |
| ISSN号 | 0302-9743 |
| ISBN号 | 978-3-642-02269-2 |
| 源URL | [http://124.16.136.157/handle/311060/8342]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
| 推荐引用方式 GB/T 7714 | Zheng Yujun,Xue Jinyun,Zuo Zhengkang. toward an automatic approach to greedy algorithms[C]. 见:3rd International Workshop on Frontiers in Algorithmics. Hefei, PEOPLES R CHINA. JUN 20-23,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。