| problem reduction graph model for discrete optimization problems |
| Zheng Yujun; Xue Jinyun
|
| 2010
|
| 会议名称 | 3rd International Joint Conference on Computational Sciences and Optimization, CSO 2010: Theoretical Development and Engineering Practice
|
| 会议录名称 | 3rd International Joint Conference on Computational Sciences and Optimization, CSO 2010: Theoretical Development and Engineering Practice
|
| 页码 | 190-194
|
| 会议日期 | 43979
|
| 会议地点 | Huangshan, Anhui, China
|
| 出版地 | United States
|
| ISBN | 9780770000000
|
| 部门归属 | (1) State Key Lab of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Provincial Key Lab of High Performance Computing, Jiangxi Normal University, Nanchang, China; (3) Graduate University, Chinese Academy of Sciences, Beijing, China
|
| 摘要 | The paper proposes the problem reduction graph (PRG), an abstract model for discrete optimization problems which uses structural decomposition to reduce problem complexity and constructs the recurrence relations between the problem and its subproblems. We develop several important algorithm patterns for PRG construction, each leading to a special class of concrete problem-solving algorithms in a systematic way. The model supports logical transformation from specifications to algorithmic programs by deductive inference, and thus significantly promotes the automation and reusability of algorithm design. © 2010 IEEE. |
| 关键词 | Algorithms
Combinatorial Optimization
Computer Software Reusability
Inference Engines
Reusability
|
| 主办者 | Chinese Academy of Sciences (CAS); Dep. Manage. Sci. Natl. Nat. Sci. Found. China (NSFC); Academy of Mathematics and Systems Science of CAS; Institute of Systems Science of CAS; Centre for Forecasting Science (CEFS) of CAS
|
| 内容类型 | 会议论文
|
| URI标识 | http://ir.iscas.ac.cn/handle/311060/8860
|
| 专题 | 基础软件与系统重点实验室
|
推荐引用方式
GB/T 7714 |
Zheng Yujun,Xue Jinyun. problem reduction graph model for discrete optimization problems[C]. United States,2010:190-194.
|
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论