ISCAS OpenIR  > 基础软件与系统重点实验室
toward an automatic approach to greedy algorithms
Zheng Yujun; Xue Jinyun; Zuo Zhengkang
2009
会议名称3rd International Workshop on Frontiers in Algorithmics
会议录名称Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码302-313
会议日期JUN 20-23,
会议地点Hefei, PEOPLES R CHINA
收录类别istp,ei,acm
出版地HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者FRONTIERS IN ALGORITHMICS, PROCEEDINGS
ISSN0302-9743
ISBN978-3-642-02269-2
部门归属Zheng, Yujun; Xue, Jinyun; Zuo, Zhengkang Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
摘要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.
关键词Combinatorial Optimization Problems Par Method Problem Singleton Greedy Algorithm
语种英语
内容类型会议论文
URI标识http://ir.iscas.ac.cn/handle/311060/8342
专题基础软件与系统重点实验室
推荐引用方式
GB/T 7714
Zheng Yujun,Xue Jinyun,Zuo Zhengkang. toward an automatic approach to greedy algorithms[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:FRONTIERS IN ALGORITHMICS, PROCEEDINGS,2009:302-313.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zheng Yujun]的文章
[Xue Jinyun]的文章
[Zuo Zhengkang]的文章
百度学术
百度学术中相似的文章
[Zheng Yujun]的文章
[Xue Jinyun]的文章
[Zuo Zhengkang]的文章
必应学术
必应学术中相似的文章
[Zheng Yujun]的文章
[Xue Jinyun]的文章
[Zuo Zhengkang]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。