吉林大学学报(工学版) ›› 2013, Vol. 43 ›› Issue (06): 1615-1620.doi: 10.7964/jdxbgxb201306029

• paper • Previous Articles     Next Articles

Adaptive branching constraint solving with survivors-first learning value ordering heuristics

WANG Hai-yan1,2,3, OUYANG Dan-tong1,2, ZHANG Yong-gang1,2, ZHANG Liang1,2   

  1. 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China;
    2. Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education, Jilin University, Changchun 130012, China;
    3. College of Computer, Jilin Normal University, Siping 136000, China
  • Received:2012-09-29 Online:2013-11-01 Published:2013-11-01

Abstract:

The separate adaptive branching heuristics can not give full play to the advantages of adaptive constraint solving's expertise.To overcome this shortcoming,a new algorithm,AdaptBranchsurv,is proposed, which combines the Survivors-first learning value ordering heuristics with adaptive branching scheme.The experimental results of some typical Benchmark problems show that the proposed algorithm AdaptBranchsurv can significantly improve the efficiency of constraint solving.

Key words: artificial intelligence, constraint satisfaction problems, adaptive constraint solving, adaptive branching, learning value ordering heuristics

CLC Number: 

  • TP31

[1] 王海燕,郭劲松,欧阳丹彤,等.基于比特位操作的自适应约束传播算法[J].吉林大学学报:工学版,2012, 42(5): 1219-1224. Wang Hai-yan,Guo Jin-song,Ouyang Dan-tong,et al.Adaptive propagation algorithm based on bitwise operations[J].Journal of Jilin University(Engineering and Technology Edition),2012,42(5):1219-1224.

[2] Balafoutis T,Paparrizou A,Stergiou K.Experimental evaluation of branching schemes for the CSP[C]//Proceedings of the TRICS Workshop at CP-2010,St Andrews, Scotland,2010:1-12.

[3] Balafoutis T,Stergiou K.Adaptive branching for constraint satisfaction problems[C]//Proceedings of ECAI,Lisbon, Portugal,2010:855-860.

[4] Zhang Z,Epstein S L.Learned value-ordering heuristics for constraint satisfaction[C]//Proceedinigs of STAIR-08 Workshop at AAAI-2008,Chicago,Illinois,2008:154-161.

[5] Frost D,Dechter R.Look-Ahead value ordering for constraint satisfaction problems[C]//Proceedings of IJCAI,Montréal,Québec,Canada,1995:572-578.

[6] Stergiou K. Heuristics for dynamically adapting propagation in constraint satisfaction problems[J].AI Communications, 2009,22(3):125-141.

[7] Boussemart F,Heremy F,Lecoutre C,et al.Boosting systematic search by weighting constraints[C]//Proceedings of ECAI,Valencia, Spain,2004: 482-486.

[8] Grimes D,Wallace R J.Sampling strategies and variable selection in weighted degree heuristics[C]//Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming,Berlin,Heidelberg,2007:831-838.

[9] Likitvivatanavong C,Zhang Y L,Bowen J, et al. Arc consistency during search[C]//Proceedings of the 20th International Joint Conference on Artifical Intelligence,Hyderabad, India,2007:137-142.

[1] DONG Sa, LIU Da-you, OUYANG Ruo-chuan, ZHU Yun-gang, LI Li-na. Logistic regression classification in networked data with heterophily based on second-order Markov assumption [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1571-1577.
[2] GU Hai-jun, TIAN Ya-qian, CUI Ying. Intelligent interactive agent for home service [J]. Journal of Jilin University(Engineering and Technology Edition), 2018, 48(5): 1578-1585.
[3] WANG Xu, OUYANG Ji-hong, CHEN Gui-fen. Measurement of graph similarity based on vertical dimension sequence dynamic time warping method [J]. 吉林大学学报(工学版), 2018, 48(4): 1199-1205.
[4] ZHANG Hao, ZHAN Meng-ping, GUO Liu-xiang, LI Zhi, LIU Yuan-ning, ZHANG Chun-he, CHANG Hao-wu, WANG Zhi-qiang. Human exogenous plant miRNA cross-kingdom regulatory modeling based on high-throughout data [J]. 吉林大学学报(工学版), 2018, 48(4): 1206-1213.
[5] HUANG Lan, JI Lin-ying, YAO Gang, ZHAI Rui-feng, BAI Tian. Construction of disease-symptom semantic net for misdiagnosis prompt [J]. 吉林大学学报(工学版), 2018, 48(3): 859-865.
[6] LI Xiong-fei, FENG Ting-ting, LUO Shi, ZHANG Xiao-li. Automatic music composition algorithm based on recurrent neural network [J]. 吉林大学学报(工学版), 2018, 48(3): 866-873.
[7] LIU Jie, ZHANG Ping, GAO Wan-fu. Feature selection method based on conditional relevance [J]. 吉林大学学报(工学版), 2018, 48(3): 874-881.
[8] WANG Xu, OUYANG Ji-hong, CHEN Gui-fen. Heuristic algorithm of all common subsequences of multiple sequences for measuring multiple graphs similarity [J]. 吉林大学学报(工学版), 2018, 48(2): 526-532.
[9] YANG Xin, XIA Si-jun, LIU Dong-xue, FEI Shu-min, HU Yin-ji. Target tracking based on improved accelerated gradient under tracking-learning-detection framework [J]. 吉林大学学报(工学版), 2018, 48(2): 533-538.
[10] LIU Xue-juan, YUAN Jia-bin, XU Juan, DUAN Bo-jia. Quantum k-means algorithm [J]. 吉林大学学报(工学版), 2018, 48(2): 539-544.
[11] QU Hui-yan, ZHAO Wei, QIN Ai-hong. A fast collision detection algorithm based on optimization operator [J]. 吉林大学学报(工学版), 2017, 47(5): 1598-1603.
[12] LI Jia-fei, SUN Xiao-yu. Clustering method for uncertain data based on spectral decomposition [J]. 吉林大学学报(工学版), 2017, 47(5): 1604-1611.
[13] SHAO Ke-yong, CHEN Feng, WANG Ting-ting, WANG Ji-chi, ZHOU Li-peng. Full state based adaptive control of fractional order chaotic system without equilibrium point [J]. 吉林大学学报(工学版), 2017, 47(4): 1225-1230.
[14] WANG Sheng-sheng, WANG Chuang-feng, GU Fang-ming. Spatio-temporal reasoning for OPRA direction relation network [J]. 吉林大学学报(工学版), 2017, 47(4): 1238-1243.
[15] MA Miao, LI Yi-bin. Multi-level image sequences and convolutional neural networks based human action recognition method [J]. 吉林大学学报(工学版), 2017, 47(4): 1244-1252.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!