Source: Neurocomputing. Unidade: ICMC
Subjects: INTELIGÊNCIA ARTIFICIAL, APRENDIZADO COMPUTACIONAL, HEURÍSTICA
ABNT
KANDA, Jorge et al. Meta-learning to select the best meta-heuristic for the Traveling Salesman Problem: a comparison of meta-features. Neurocomputing, v. 205, p. Se 2016, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.neucom.2016.04.027. Acesso em: 22 ago. 2024.APA
Kanda, J., Carvalho, A. C. P. de L. F. de, Hruschka, E. R., Soares, C., & Brazdil, P. (2016). Meta-learning to select the best meta-heuristic for the Traveling Salesman Problem: a comparison of meta-features. Neurocomputing, 205, Se 2016. doi:10.1016/j.neucom.2016.04.027NLM
Kanda J, Carvalho ACP de LF de, Hruschka ER, Soares C, Brazdil P. Meta-learning to select the best meta-heuristic for the Traveling Salesman Problem: a comparison of meta-features [Internet]. Neurocomputing. 2016 ; 205 Se 2016.[citado 2024 ago. 22 ] Available from: https://doi.org/10.1016/j.neucom.2016.04.027Vancouver
Kanda J, Carvalho ACP de LF de, Hruschka ER, Soares C, Brazdil P. Meta-learning to select the best meta-heuristic for the Traveling Salesman Problem: a comparison of meta-features [Internet]. Neurocomputing. 2016 ; 205 Se 2016.[citado 2024 ago. 22 ] Available from: https://doi.org/10.1016/j.neucom.2016.04.027