a category theoretic approach to search algorithms: towards a unified implementation for branch-and-bound and backtracking
文献类型：会议论文
| 作者 | Zheng Yujun ; Xue Jinyun ; Shi Haihe |
| 出版日期 | 2009 |
| 会议名称 | 4th International Conference on Computer Science and Education |
| 会议日期 | JUL 25-28, |
| 会议地点 | Nanning, PEOPLES R CHINA |
| 关键词 | Category theory PAR Colimit Branch-and-Bound Backtracking |
| 英文摘要 | Branch-and-bound and backtracking are widely used for search and optimization problems, but their implementations vary from problem to problem. In this paper we propose a unified approach of program derivation and generation for the two classes of algorithms. We first define a generalized specification for the search strategies, and then derive the algorithms, abstract programs and generic programs by incremental refinements on PAR platform, and finally generate efficient programs for concrete problem-solving via colimit computations. Our approach achieves a high level of abstraction and mechanization without losing performance. |
| 会议主办者 | IEEE, Comp Educ Coll & Univ, Natl Res Council, Guangxi Univ, IEEE Control Syst Chapter, Guangzhou, IEEE Control Syst Chapter, Singapore, Univ Melbourne, Univ Virginia, Univ Texas, Univ British Columbia, Xiamen Univ, Chongqing Univ, Xiamen Xinhangha Ctr Comp Educ & Dev |
| 会议录 | Proceedings of 2009 4th International Conference on Computer Science and Education, ICCSE 2009
 |
| 会议录出版者 | ICCSSE 2009: PROCEEDINGS OF 2009 4TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION |
| 会议录出版地 | 345 E 47TH ST, NEW YORK, NY 10017 USA |
| ISBN号 | 978-1-4244-3519-7 |
| 源URL | [http://124.16.136.157/handle/311060/8312]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
| 推荐引用方式 GB/T 7714 | Zheng Yujun,Xue Jinyun,Shi Haihe. a category theoretic approach to search algorithms: towards a unified implementation for branch-and-bound and backtracking[C]. 见:4th International Conference on Computer Science and Education. Nanning, PEOPLES R CHINA. JUL 25-28,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。