Novel adaptive branching constraint solving algorithm with look-ahead strategy
paper|更新时间:2024-06-05
|
Novel adaptive branching constraint solving algorithm with look-ahead strategy
Journal on CommunicationsVol. 34, Issue 6, Pages: 102-107(2013)
作者机构:
1. 吉林大学 计算机科学与技术学院,吉林 长春 130012
2. 吉林大学 符号计算与知识工程教育部重点实验室,吉林 长春 130012
3. 吉林师范大学 计算机学院,吉林 四平 136000
作者简介:
基金信息:
The National Natural Science Foundation of China(61170314);The National Natural Science Foundation of China(61133011);The National Natural Science Foundation of China(60973089);The National Natural Science Foundation of China(61003101);The National Natural Science Foundation of China(61170092);The National Natural Science Foundation of China(60973088);The National Natural Science Foundation of China(41172294);Jilin Province Science and Technology Development Plan(20101501);Jilin Province Science and Technology Development Plan(20100185);Jilin Province Science and Technology Development Plan(201101039);Doctoral Fund of Ministry of Education of China(20100061110031)
Improved ant colony optimization algorithm for solving constraint satisfaction problem
Related Author
HANGYong-gang Z
HANGSi-bo Z
UEQiu-shi X
Related Institution
College of Comprter Science and Technology,Jilin university,Changchun 130012,China;2.Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education