Author:
Chen Yuh-Min,Chen Min-Chih,Chang Pei-Chann,Chen Shih-Hsin
Subject
General Engineering,General Computer Science
Reference31 articles.
1. Baluja, S., & Davies, S. (1998). Fast probabilistic modeling for combinatorial optimization. In Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence table of contents (pp. 469–476).
2. Inexact graph matching by means of estimation of distribution algorithms;Bengoetxea;Pattern Recognition,2002
3. Crossing the road to efficient idfas for permutation problems;Bosman,2001
4. Addressing sampling errors and diversity loss in UMDA;Branke,2007
5. Ceberio, J. E., Irurozki, A. M., & Lozano, J. (2012). A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems. Progress in Artificial Intelligence, in press. doi:10.1007/s13748-011-0005-3.
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献