Data structures for direct spanning tree representations in mutation-based evolutionary algorithms (2020)
- Authors:
- Autor USP: DELBEM, ALEXANDRE CLÁUDIO BOTAZZO - ICMC
- Unidade: ICMC
- DOI: 10.1109/TEVC.2019.2928991
- Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
- Keywords: Dynamic tree data structures; evolutionary algorithms; tree representations
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: Piscataway
- Date published: 2020
- Source:
- Título: IEEE Transactions on Evolutionary Computation
- ISSN: 1089-778X
- Volume/Número/Paginação/Ano: v. 24, n. 3, p. 467-478, 2020
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
BARBOSA, Marco A. L e DELBEM, Alexandre Cláudio Botazzo e BUENO, Letícia Rodrigues. Data structures for direct spanning tree representations in mutation-based evolutionary algorithms. IEEE Transactions on Evolutionary Computation, v. 24, n. 3, p. 467-478, 2020Tradução . . Disponível em: https://doi.org/10.1109/TEVC.2019.2928991. Acesso em: 28 fev. 2026. -
APA
Barbosa, M. A. L., Delbem, A. C. B., & Bueno, L. R. (2020). Data structures for direct spanning tree representations in mutation-based evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 24( 3), 467-478. doi:10.1109/TEVC.2019.2928991 -
NLM
Barbosa MAL, Delbem ACB, Bueno LR. Data structures for direct spanning tree representations in mutation-based evolutionary algorithms [Internet]. IEEE Transactions on Evolutionary Computation. 2020 ; 24( 3): 467-478.[citado 2026 fev. 28 ] Available from: https://doi.org/10.1109/TEVC.2019.2928991 -
Vancouver
Barbosa MAL, Delbem ACB, Bueno LR. Data structures for direct spanning tree representations in mutation-based evolutionary algorithms [Internet]. IEEE Transactions on Evolutionary Computation. 2020 ; 24( 3): 467-478.[citado 2026 fev. 28 ] Available from: https://doi.org/10.1109/TEVC.2019.2928991 - On the effectiveness of genetic algorithms for the multidimensional knapsack problem
- Multimodality and the linkage-learning difficulty of additively separable functions
- Using smart sampling to discover promising regions and increase the efficiency of differential evolution
- Permutation-based recombination operator to node-depth encoding
- An analysis and evaluation of the WeFold collaborative for protein structure prediction and its pipelines in CASP11 and CASP12
- A multi-criterion evolutionary approach applied to phylogenetic reconstruction
- Ensemble of predictors and laser induced breakdown spectroscopy for certifying coffee
- Mutation-based compact genetic algorithm for spectroscopy variable selection in determining protein concentration in wheat grain
- Reduced pareto set genetic algorithm: application to protein structure prediction
- Multi-objective phylogenetic algorithm: solving multi-objective decomposable deceptive problems
Informações sobre o DOI: 10.1109/TEVC.2019.2928991 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2953815.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
