Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computer Vision and Pattern Recognition,Software
Reference55 articles.
1. Knapsack problem benchmark set. http://pages.mtu.edu/~kreher/cages/Data.html . Accessed 1 Oct 2018
2. Abdel-Basset M, Luo Q, Miao F, Zhou Y (2017) Solving 0–1 knapsack problems by binary dragonfly algorithm. International conference on intelligent computing. Springer, New York, pp 491–502
3. Ahmed S, Mafarja M, Faris H, Aljarah I (2018) Feature selection using salp swarm algorithm with chaos. In: Proceedings of the 2nd international conference on intelligent systems, metaheuristics & swarm intelligence. ACM, pp 65–69
4. Alamedine D, Marque C, Khalil M (2013) Binary particle swarm optimization for feature selection on uterine electrohysterogram signal. Advances in biomedical engineering (ICABME), 2013 2nd international conference on. IEEE, Piscataway, pp 125–128
5. Aljarah I, Mafarja M, Heidari AA, Faris H, Zhang Y, Mirjalili S (2018) Asynchronous accelerating multi-leader salp chains for feature selection. Appl Soft Comput 71:964–979
Cited by
64 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献