中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 计算机科学国家重点实验室  > 会议论文
Title:
a category theoretic approach to search algorithms: towards a unified implementation for branch-and-bound and backtracking
Author: Zheng Yujun ; Xue Jinyun ; Shi Haihe
Source: Proceedings of 2009 4th International Conference on Computer Science and Education, ICCSE 2009
Conference Name: 4th International Conference on Computer Science and Education
Conference Date: JUL 25-28,
Issued Date: 2009
Conference Place: Nanning, PEOPLES R CHINA
Keyword: Category theory ; PAR ; Colimit ; Branch-and-Bound ; Backtracking
Publisher: ICCSSE 2009: PROCEEDINGS OF 2009 4TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION
Publish Place: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-3519-7
Department: Zheng Yujun Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China.
Sponsorship: 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
English Abstract: 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.
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/8312
Appears in Collections:计算机科学国家重点实验室 _会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
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,.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Zheng Yujun]'s Articles
[Xue Jinyun]'s Articles
[Shi Haihe]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zheng Yujun]‘s Articles
[Xue Jinyun]‘s Articles
[Shi Haihe]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace