| 非二元约束满足问题的E-GENET求解原理 |
| |
| 引用本文： | 冯欣,唐立新,梁浩锋. 非二元约束满足问题的E-GENET求解原理[J]. 东北大学学报(自然科学版), 2005, 26(9): 844-847. DOI: - |
| |
| 作者姓名： | 冯欣 唐立新 梁浩锋 |
| |
| 作者单位： | 东北大学,教育部暨辽宁省流程工业综合自动化重点实验室,辽宁,沈阳,110004;香港中文大学,计算机科学与工程系,香港,新界 |
| |
| 基金项目： | 国家自然科学基金，国家自然科学基金 |
| |
| 摘 要： | 通过E-GENET的重定义,将非二元约束满足问题(NB-CSPs)转化为整数最小化问题,提出一类非二元变量约束关系的离散拉格朗日搜索模式(NB-LSDL)与算法,实现了基于NB-LSDL的E-GENET重构,为求解一般约束CSPs的最小冲突启发式修补方法提供新的理论依据,扩展了E-GENET处理问题的技术与手段.实验结果显示了方法的可行性与有效性.
|
| 关 键 词： | 约束满足问题 E-GENET网 离散拉格朗日方法 启发式修补方法 |
| 文章编号： | 1005-3026（2005）09-0844-04 |
| 收稿时间： | 2004-12-07 |
| 修稿时间： | 2004-12-07 |
Theory of Solving of E-GENET for Non-Binary Constraint Satisfaction Problems |
| |
| FENG Xin,TANG Li-xin,LIANG Hao-feng. Theory of Solving of E-GENET for Non-Binary Constraint Satisfaction Problems[J]. Journal of Northeastern University(Natural Science), 2005, 26(9): 844-847. DOI: - |
| |
| Authors: | FENG Xin TANG Li-xin LIANG Hao-feng |
| |
| Affiliation: | (1) Key Laboratory of Process Industry Automation, Northeastern University, Shenyang 110004, China; (2) Department of Computer Science and Engineering, Chinese University of Hong Kong, Hong Kong, Hong Kong |
| |
| Abstract: | Non-binary constraint satisfaction problems (NB-CSPs) are transformed into the integer constrained minimization problems by extending correlative definitions of E-GENET. Then, a class of discrete Lagrangian-based search scheme and algorithm with non-binary variable constraints (NB-LSDL) is proposed for such probllems to restructure E-GENET from NB-LSDL. It is useful to gain important insights into the heuristic repair method to minimize conflicts and improve variant of E-GENET for the CSPs with general constraints in a new theoretical perspective. The experimental results show that it is effective and feasible to re-extend E-GENET by using NB-LSDL. |
| |
| Keywords: | constraint satisfaction problems E-GENET network discrete Lagrangian method heuristic repair method |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《东北大学学报(自然科学版)》下载全文 |
