Filtros : "ALGORITMOS GENÉTICOS" "Indexado no Web of Science" Removido: "Evolutionary Intelligence" Limpar

Filtros



Refine with date range


  • Source: Computers and Operations Research. Unidade: EESC

    Subjects: PESQUISA OPERACIONAL, ALGORITMOS GENÉTICOS, PROGRAMAÇÃO DA PRODUÇÃO, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ROLIM, Gustavo Alencar e NAGANO, Marcelo Seido. Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups?. Computers and Operations Research, v. 182, p. 1-15, 2025Tradução . . Disponível em: https://dx.doi.org/10.1016/j.cor.2025.107110. Acesso em: 28 nov. 2025.
    • APA

      Rolim, G. A., & Nagano, M. S. (2025). Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups? Computers and Operations Research, 182, 1-15. doi:10.1016/j.cor.2025.107110
    • NLM

      Rolim GA, Nagano MS. Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups? [Internet]. Computers and Operations Research. 2025 ; 182 1-15.[citado 2025 nov. 28 ] Available from: https://dx.doi.org/10.1016/j.cor.2025.107110
    • Vancouver

      Rolim GA, Nagano MS. Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups? [Internet]. Computers and Operations Research. 2025 ; 182 1-15.[citado 2025 nov. 28 ] Available from: https://dx.doi.org/10.1016/j.cor.2025.107110
  • Source: Applied Soft Computing. Unidade: ICMC

    Subjects: APRENDIZADO COMPUTACIONAL, ALGORITMOS GENÉTICOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERRANDIN, Mauri e CERRI, Ricardo. Ensemble multi-label classification using closed frequent labelsets and label taxonomies. Applied Soft Computing, v. 171, p. 1-12, 2025Tradução . . Disponível em: https://doi.org/10.1016/j.asoc.2025.112853. Acesso em: 28 nov. 2025.
    • APA

      Ferrandin, M., & Cerri, R. (2025). Ensemble multi-label classification using closed frequent labelsets and label taxonomies. Applied Soft Computing, 171, 1-12. doi:10.1016/j.asoc.2025.112853
    • NLM

      Ferrandin M, Cerri R. Ensemble multi-label classification using closed frequent labelsets and label taxonomies [Internet]. Applied Soft Computing. 2025 ; 171 1-12.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.asoc.2025.112853
    • Vancouver

      Ferrandin M, Cerri R. Ensemble multi-label classification using closed frequent labelsets and label taxonomies [Internet]. Applied Soft Computing. 2025 ; 171 1-12.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.asoc.2025.112853
  • Source: Concurrency and Computation : Practice and Experience. Unidade: ICMC

    Subjects: ALGORITMOS GENÉTICOS, TESTE E AVALIAÇÃO DE SOFTWARE, PROGRAMAÇÃO CONCORRENTE

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      VILELA, Ricardo Ferreira et al. Bio-inspired optimization to support the test data generation of concurrent software. Concurrency and Computation : Practice and Experience, v. 35, n. 2, p. 1-30, 2023Tradução . . Disponível em: https://doi.org/10.1002/cpe.7489. Acesso em: 28 nov. 2025.
    • APA

      Vilela, R. F., Choma Neto, J., Pinto, V. H. S. C., Souza, P. S. L. de, & Souza, S. do R. S. de. (2023). Bio-inspired optimization to support the test data generation of concurrent software. Concurrency and Computation : Practice and Experience, 35( 2), 1-30. doi:10.1002/cpe.7489
    • NLM

      Vilela RF, Choma Neto J, Pinto VHSC, Souza PSL de, Souza S do RS de. Bio-inspired optimization to support the test data generation of concurrent software [Internet]. Concurrency and Computation : Practice and Experience. 2023 ; 35( 2): 1-30.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1002/cpe.7489
    • Vancouver

      Vilela RF, Choma Neto J, Pinto VHSC, Souza PSL de, Souza S do RS de. Bio-inspired optimization to support the test data generation of concurrent software [Internet]. Concurrency and Computation : Practice and Experience. 2023 ; 35( 2): 1-30.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1002/cpe.7489
  • Source: Physica A. Unidades: ICMC, FEA

    Subjects: REDES COMPLEXAS, FINANÇAS, ALGORITMOS GENÉTICOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ALEXANDRE, Michel et al. Efficiency-stability trade-off in financial systems: a multi-objective optimization approach. Physica A, v. 629, p. 1-9, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.physa.2023.129213. Acesso em: 28 nov. 2025.
    • APA

      Alexandre, M., Michalak, K., Silva, T. C., & Rodrigues, F. A. (2023). Efficiency-stability trade-off in financial systems: a multi-objective optimization approach. Physica A, 629, 1-9. doi:10.1016/j.physa.2023.129213
    • NLM

      Alexandre M, Michalak K, Silva TC, Rodrigues FA. Efficiency-stability trade-off in financial systems: a multi-objective optimization approach [Internet]. Physica A. 2023 ; 629 1-9.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.physa.2023.129213
    • Vancouver

      Alexandre M, Michalak K, Silva TC, Rodrigues FA. Efficiency-stability trade-off in financial systems: a multi-objective optimization approach [Internet]. Physica A. 2023 ; 629 1-9.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.physa.2023.129213
  • Source: Polymers. Unidade: ICMC

    Subjects: ALGORITMOS GENÉTICOS, POLÍMEROS (MATERIAIS), MINERAÇÃO DE DADOS, TOMADA DE DECISÃO

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      GASPAR-CUNHA, António et al. Evolutionary multi-objective optimization of extrusion barrier screws: data mining and decision making. Polymers, v. 15, n. 9, p. 1-23, 2023Tradução . . Disponível em: https://doi.org/10.3390/polym15092212. Acesso em: 28 nov. 2025.
    • APA

      Gaspar-Cunha, A., Costa, P., Delbem, A. C. B., Monaco, F. J., Ferreira, M. J., & José Covas,. (2023). Evolutionary multi-objective optimization of extrusion barrier screws: data mining and decision making. Polymers, 15( 9), 1-23. doi:10.3390/polym15092212
    • NLM

      Gaspar-Cunha A, Costa P, Delbem ACB, Monaco FJ, Ferreira MJ, José Covas. Evolutionary multi-objective optimization of extrusion barrier screws: data mining and decision making [Internet]. Polymers. 2023 ; 15( 9): 1-23.[citado 2025 nov. 28 ] Available from: https://doi.org/10.3390/polym15092212
    • Vancouver

      Gaspar-Cunha A, Costa P, Delbem ACB, Monaco FJ, Ferreira MJ, José Covas. Evolutionary multi-objective optimization of extrusion barrier screws: data mining and decision making [Internet]. Polymers. 2023 ; 15( 9): 1-23.[citado 2025 nov. 28 ] Available from: https://doi.org/10.3390/polym15092212
  • Source: Health Information Science and Systems. Unidade: ICMC

    Subjects: SISTEMA DE SAÚDE, ALGORITMOS GENÉTICOS, TELEMEDICINA

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PANG, Xinyu et al. Patient assignment optimization in cloud healthcare systems: a distributed genetic algorithm. Health Information Science and Systems, v. 11, p. 1-12, 2023Tradução . . Disponível em: https://doi.org/10.1007/s13755-023-00230-1. Acesso em: 28 nov. 2025.
    • APA

      Pang, X., Ge, Y. ‑F., Wang, K., Traina, A. J. M., & Wang, H. (2023). Patient assignment optimization in cloud healthcare systems: a distributed genetic algorithm. Health Information Science and Systems, 11, 1-12. doi:10.1007/s13755-023-00230-1
    • NLM

      Pang X, Ge Y‑F, Wang K, Traina AJM, Wang H. Patient assignment optimization in cloud healthcare systems: a distributed genetic algorithm [Internet]. Health Information Science and Systems. 2023 ; 11 1-12.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/s13755-023-00230-1
    • Vancouver

      Pang X, Ge Y‑F, Wang K, Traina AJM, Wang H. Patient assignment optimization in cloud healthcare systems: a distributed genetic algorithm [Internet]. Health Information Science and Systems. 2023 ; 11 1-12.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/s13755-023-00230-1
  • Source: Applied Soft Computing. Unidade: ICMC

    Subjects: ALGORITMOS GENÉTICOS, PROGRAMAÇÃO GENÉTICA, JOGOS DE COMPUTADOR

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MARIÑO, Julian Ricardo Hernandez e TOLEDO, Claudio Fabiano Motta. Evolving interpretable strategies for zero-sum games. Applied Soft Computing, v. 122, p. 1-11, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.asoc.2022.108860. Acesso em: 28 nov. 2025.
    • APA

      Mariño, J. R. H., & Toledo, C. F. M. (2022). Evolving interpretable strategies for zero-sum games. Applied Soft Computing, 122, 1-11. doi:10.1016/j.asoc.2022.108860
    • NLM

      Mariño JRH, Toledo CFM. Evolving interpretable strategies for zero-sum games [Internet]. Applied Soft Computing. 2022 ; 122 1-11.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.asoc.2022.108860
    • Vancouver

      Mariño JRH, Toledo CFM. Evolving interpretable strategies for zero-sum games [Internet]. Applied Soft Computing. 2022 ; 122 1-11.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.asoc.2022.108860
  • Source: Applied Sciences. Unidade: ICMC

    Subjects: APRENDIZADO COMPUTACIONAL, BIOINFORMÁTICA, HEURÍSTICA, ALGORITMOS GENÉTICOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MATOS, Everton Alex et al. Pilot sequence allocation schemes in massive MIMO systems using heuristic approaches. Applied Sciences, v. 12, n. 10, p. 1-21, 2022Tradução . . Disponível em: https://doi.org/10.3390/app12105117. Acesso em: 28 nov. 2025.
    • APA

      Matos, E. A., Bonidia, R. P., Sanches, D. S., Pozza, R. S., & Sampaio, L. D. H. (2022). Pilot sequence allocation schemes in massive MIMO systems using heuristic approaches. Applied Sciences, 12( 10), 1-21. doi:10.3390/app12105117
    • NLM

      Matos EA, Bonidia RP, Sanches DS, Pozza RS, Sampaio LDH. Pilot sequence allocation schemes in massive MIMO systems using heuristic approaches [Internet]. Applied Sciences. 2022 ; 12( 10): 1-21.[citado 2025 nov. 28 ] Available from: https://doi.org/10.3390/app12105117
    • Vancouver

      Matos EA, Bonidia RP, Sanches DS, Pozza RS, Sampaio LDH. Pilot sequence allocation schemes in massive MIMO systems using heuristic approaches [Internet]. Applied Sciences. 2022 ; 12( 10): 1-21.[citado 2025 nov. 28 ] Available from: https://doi.org/10.3390/app12105117
  • Source: Ingeniería e Investigación. Unidade: EESC

    Subjects: ALGORITMOS GENÉTICOS, SERVIÇO AO CLIENTE, TOMADA DE DECISÃO, ENGENHARIA DE PRODUÇÃO

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PINTO, Anderson Rogério Faia e NAGANO, Marcelo Seido. An efficient algorithm applied to optimized billing sequencing. Ingeniería e Investigación, v. 42, n. 2, p. 1-12, 2022Tradução . . Disponível em: https://doi.org/10.15446/ing.investig.v42n2.83394. Acesso em: 28 nov. 2025.
    • APA

      Pinto, A. R. F., & Nagano, M. S. (2022). An efficient algorithm applied to optimized billing sequencing. Ingeniería e Investigación, 42( 2), 1-12. doi:10.15446/ing.investig.v42n2.83394
    • NLM

      Pinto ARF, Nagano MS. An efficient algorithm applied to optimized billing sequencing [Internet]. Ingeniería e Investigación. 2022 ; 42( 2): 1-12.[citado 2025 nov. 28 ] Available from: https://doi.org/10.15446/ing.investig.v42n2.83394
    • Vancouver

      Pinto ARF, Nagano MS. An efficient algorithm applied to optimized billing sequencing [Internet]. Ingeniería e Investigación. 2022 ; 42( 2): 1-12.[citado 2025 nov. 28 ] Available from: https://doi.org/10.15446/ing.investig.v42n2.83394
  • Source: Sensors. Unidade: ICMC

    Subjects: ALGORITMOS GENÉTICOS, OTIMIZAÇÃO COMBINATÓRIA

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      VIANA, Monique Simplicio e CONTRERAS, Rodrigo Colnago e MORANDIN JUNIOR, Orides. A new frequency analysis operator for population improvement in genetic algorithms to solve the job shop scheduling problem. Sensors, v. 22, p. 1-26, 2022Tradução . . Disponível em: https://doi.org/10.3390/s22124561. Acesso em: 28 nov. 2025.
    • APA

      Viana, M. S., Contreras, R. C., & Morandin Junior, O. (2022). A new frequency analysis operator for population improvement in genetic algorithms to solve the job shop scheduling problem. Sensors, 22, 1-26. doi:10.3390/s22124561
    • NLM

      Viana MS, Contreras RC, Morandin Junior O. A new frequency analysis operator for population improvement in genetic algorithms to solve the job shop scheduling problem [Internet]. Sensors. 2022 ; 22 1-26.[citado 2025 nov. 28 ] Available from: https://doi.org/10.3390/s22124561
    • Vancouver

      Viana MS, Contreras RC, Morandin Junior O. A new frequency analysis operator for population improvement in genetic algorithms to solve the job shop scheduling problem [Internet]. Sensors. 2022 ; 22 1-26.[citado 2025 nov. 28 ] Available from: https://doi.org/10.3390/s22124561
  • Source: Applied Soft Computing. Unidade: ICMC

    Subjects: JOGOS DE COMPUTADOR, OTIMIZAÇÃO RESTRITA, ALGORITMOS GENÉTICOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      VIANA, Breno Mauricio de Freitas et al. Feasible-infeasible two-population genetic algorithm to evolve dungeon levels with dependencies in barrier mechanics. Applied Soft Computing, v. 119, p. 1-16, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.asoc.2022.108586. Acesso em: 28 nov. 2025.
    • APA

      Viana, B. M. de F., Pereira, L. T., Toledo, C. F. M., Santos, S. R. dos, & Maia, S. M. D. M. (2022). Feasible-infeasible two-population genetic algorithm to evolve dungeon levels with dependencies in barrier mechanics. Applied Soft Computing, 119, 1-16. doi:10.1016/j.asoc.2022.108586
    • NLM

      Viana BM de F, Pereira LT, Toledo CFM, Santos SR dos, Maia SMDM. Feasible-infeasible two-population genetic algorithm to evolve dungeon levels with dependencies in barrier mechanics [Internet]. Applied Soft Computing. 2022 ; 119 1-16.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.asoc.2022.108586
    • Vancouver

      Viana BM de F, Pereira LT, Toledo CFM, Santos SR dos, Maia SMDM. Feasible-infeasible two-population genetic algorithm to evolve dungeon levels with dependencies in barrier mechanics [Internet]. Applied Soft Computing. 2022 ; 119 1-16.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.asoc.2022.108586
  • Source: Swarm and Evolutionary Computation. Unidade: EESC

    Subjects: INDÚSTRIA FARMACÊUTICA, CONTATOS COM CLIENTES, ALGORITMOS GENÉTICOS, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ABREU, Levi Ribeiro de et al. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness. Swarm and Evolutionary Computation, v. 75, p. 1-13, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.swevo.2022.101149. Acesso em: 28 nov. 2025.
    • APA

      Abreu, L. R. de, Prata, B. de A., Gomes, A. C., Santos, S. A. B., & Nagano, M. S. (2022). A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness. Swarm and Evolutionary Computation, 75, 1-13. doi:10.1016/j.swevo.2022.101149
    • NLM

      Abreu LR de, Prata B de A, Gomes AC, Santos SAB, Nagano MS. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness [Internet]. Swarm and Evolutionary Computation. 2022 ; 75 1-13.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.swevo.2022.101149
    • Vancouver

      Abreu LR de, Prata B de A, Gomes AC, Santos SAB, Nagano MS. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness [Internet]. Swarm and Evolutionary Computation. 2022 ; 75 1-13.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.swevo.2022.101149
  • Source: Journal of Intelligent and Robotic Systems. Unidades: ICMC, EESC

    Subjects: AERONAVES NÃO TRIPULADAS, ALGORITMOS GENÉTICOS, VENTO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      XAVIER, Daniel Martin e SILVA, Natassya Barlate Floro da e BRANCO, Kalinka Regina Lucas Jaquie Castelo. Path‑following algorithms comparison using software‑in‑the‑loop simulations for UAVs. Journal of Intelligent and Robotic Systems, v. 106, p. 1-17, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10846-022-01764-4. Acesso em: 28 nov. 2025.
    • APA

      Xavier, D. M., Silva, N. B. F. da, & Branco, K. R. L. J. C. (2022). Path‑following algorithms comparison using software‑in‑the‑loop simulations for UAVs. Journal of Intelligent and Robotic Systems, 106, 1-17. doi:10.1007/s10846-022-01764-4
    • NLM

      Xavier DM, Silva NBF da, Branco KRLJC. Path‑following algorithms comparison using software‑in‑the‑loop simulations for UAVs [Internet]. Journal of Intelligent and Robotic Systems. 2022 ; 106 1-17.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/s10846-022-01764-4
    • Vancouver

      Xavier DM, Silva NBF da, Branco KRLJC. Path‑following algorithms comparison using software‑in‑the‑loop simulations for UAVs [Internet]. Journal of Intelligent and Robotic Systems. 2022 ; 106 1-17.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/s10846-022-01764-4
  • Source: Applied Soft Computing Journal. Unidade: EESC

    Subjects: TOMADA DE DECISÃO, ALGORITMOS GENÉTICOS, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CALACHE, Lucas Daniel Del Rosso et al. A genetic algorithm based on dual hesitant fuzzy preference relations for consensus group decision making. Applied Soft Computing Journal, v. 121, p. 1-18, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.asoc.2022.108778. Acesso em: 28 nov. 2025.
    • APA

      Calache, L. D. D. R., Camargo, V. C. B. de, Osiro, L., & Carpinetti, L. C. R. (2022). A genetic algorithm based on dual hesitant fuzzy preference relations for consensus group decision making. Applied Soft Computing Journal, 121, 1-18. doi:10.1016/j.asoc.2022.108778
    • NLM

      Calache LDDR, Camargo VCB de, Osiro L, Carpinetti LCR. A genetic algorithm based on dual hesitant fuzzy preference relations for consensus group decision making [Internet]. Applied Soft Computing Journal. 2022 ; 121 1-18.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.asoc.2022.108778
    • Vancouver

      Calache LDDR, Camargo VCB de, Osiro L, Carpinetti LCR. A genetic algorithm based on dual hesitant fuzzy preference relations for consensus group decision making [Internet]. Applied Soft Computing Journal. 2022 ; 121 1-18.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.asoc.2022.108778
  • Source: Earth Science Informatics. Unidade: ICMC

    Subjects: ESTUDO DE CASO, ALGORITMOS GENÉTICOS, RIOS, REGRESSÃO LINEAR

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      VIEIRA, Alen Costa et al. Improving flood forecasting through feature selection by a genetic algorithm: experiments based on real data from an Amazon rainforest river. Earth Science Informatics, v. 14, p. 37-50, 2021Tradução . . Disponível em: https://doi.org/10.1007/s12145-020-00528-8. Acesso em: 28 nov. 2025.
    • APA

      Vieira, A. C., Garcia, G., Pabón, R. E. C., Cota, L. P., Souza, P. de, Ueyama, J., & Pessin, G. (2021). Improving flood forecasting through feature selection by a genetic algorithm: experiments based on real data from an Amazon rainforest river. Earth Science Informatics, 14, 37-50. doi:10.1007/s12145-020-00528-8
    • NLM

      Vieira AC, Garcia G, Pabón REC, Cota LP, Souza P de, Ueyama J, Pessin G. Improving flood forecasting through feature selection by a genetic algorithm: experiments based on real data from an Amazon rainforest river [Internet]. Earth Science Informatics. 2021 ; 14 37-50.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/s12145-020-00528-8
    • Vancouver

      Vieira AC, Garcia G, Pabón REC, Cota LP, Souza P de, Ueyama J, Pessin G. Improving flood forecasting through feature selection by a genetic algorithm: experiments based on real data from an Amazon rainforest river [Internet]. Earth Science Informatics. 2021 ; 14 37-50.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/s12145-020-00528-8
  • Source: Computing. Unidade: ICMC

    Subjects: COMPUTAÇÃO EM NUVEM, ALGORITMOS GENÉTICOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SHISHIDO, Henrique Yoshikazu et al. Optimizing security and cost of workflow execution using task annotation and genetic-based algorithm. Computing, v. 103, n. 1281-1303, 2021Tradução . . Disponível em: https://doi.org/10.1007/s00607-021-00943-9. Acesso em: 28 nov. 2025.
    • APA

      Shishido, H. Y., Estrella, J. C., Toledo, C. F. M., & Reiff-Marganiec, S. (2021). Optimizing security and cost of workflow execution using task annotation and genetic-based algorithm. Computing, 103( 1281-1303). doi:10.1007/s00607-021-00943-9
    • NLM

      Shishido HY, Estrella JC, Toledo CFM, Reiff-Marganiec S. Optimizing security and cost of workflow execution using task annotation and genetic-based algorithm [Internet]. Computing. 2021 ; 103( 1281-1303):[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/s00607-021-00943-9
    • Vancouver

      Shishido HY, Estrella JC, Toledo CFM, Reiff-Marganiec S. Optimizing security and cost of workflow execution using task annotation and genetic-based algorithm [Internet]. Computing. 2021 ; 103( 1281-1303):[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/s00607-021-00943-9
  • Source: Computers and Industrial Engineering. Unidade: ICMC

    Subjects: ALGORITMOS GENÉTICOS, PESQUISA OPERACIONAL, INDÚSTRIA DO VIDRO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      AMORIM, Flaviana Moreira de Souza et al. MILP formulation and hybrid evolutionary algorithms for the glass container industry problem with multiple furnaces. Computers and Industrial Engineering, v. 158, p. 1-14, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2021.107398. Acesso em: 28 nov. 2025.
    • APA

      Amorim, F. M. de S., Arantes, M. da S., Ferreira, M. P. de S., & Toledo, C. F. M. (2021). MILP formulation and hybrid evolutionary algorithms for the glass container industry problem with multiple furnaces. Computers and Industrial Engineering, 158, 1-14. doi:10.1016/j.cie.2021.107398
    • NLM

      Amorim FM de S, Arantes M da S, Ferreira MP de S, Toledo CFM. MILP formulation and hybrid evolutionary algorithms for the glass container industry problem with multiple furnaces [Internet]. Computers and Industrial Engineering. 2021 ; 158 1-14.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.cie.2021.107398
    • Vancouver

      Amorim FM de S, Arantes M da S, Ferreira MP de S, Toledo CFM. MILP formulation and hybrid evolutionary algorithms for the glass container industry problem with multiple furnaces [Internet]. Computers and Industrial Engineering. 2021 ; 158 1-14.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.cie.2021.107398
  • Source: IEEE Latin America Transactions. Unidade: ICMC

    Subjects: COMPUTAÇÃO EM NUVEM, ALGORITMOS GENÉTICOS, ALOCAÇÃO DE RECURSOS

    PrivadoAcesso à fonteAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LIEIRA, Douglas D et al. Algorithm for 5G resource management optimization in edge computing. IEEE Latin America Transactions, v. 19, n. 10, p. 1772-1780, 2021Tradução . . Disponível em: https://doi.org/10.1109/TLA.2021.9477278. Acesso em: 28 nov. 2025.
    • APA

      Lieira, D. D., Quessada, M. S., Cristiani, A. L., & Meneguette, R. I. (2021). Algorithm for 5G resource management optimization in edge computing. IEEE Latin America Transactions, 19( 10), 1772-1780. doi:10.1109/TLA.2021.9477278
    • NLM

      Lieira DD, Quessada MS, Cristiani AL, Meneguette RI. Algorithm for 5G resource management optimization in edge computing [Internet]. IEEE Latin America Transactions. 2021 ; 19( 10): 1772-1780.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1109/TLA.2021.9477278
    • Vancouver

      Lieira DD, Quessada MS, Cristiani AL, Meneguette RI. Algorithm for 5G resource management optimization in edge computing [Internet]. IEEE Latin America Transactions. 2021 ; 19( 10): 1772-1780.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1109/TLA.2021.9477278
  • Source: Information Sciences. Unidade: ICMC

    Subjects: REDES NEURAIS, ALGORITMOS GENÉTICOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERNANDES JUNIOR, Francisco Erivaldo e YEN, Gary G. Pruning deep convolutional neural networks architectures with evolution strategy. Information Sciences, v. 552, p. 29-47, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ins.2020.11.009. Acesso em: 28 nov. 2025.
    • APA

      Fernandes Junior, F. E., & Yen, G. G. (2021). Pruning deep convolutional neural networks architectures with evolution strategy. Information Sciences, 552, 29-47. doi:10.1016/j.ins.2020.11.009
    • NLM

      Fernandes Junior FE, Yen GG. Pruning deep convolutional neural networks architectures with evolution strategy [Internet]. Information Sciences. 2021 ; 552 29-47.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.ins.2020.11.009
    • Vancouver

      Fernandes Junior FE, Yen GG. Pruning deep convolutional neural networks architectures with evolution strategy [Internet]. Information Sciences. 2021 ; 552 29-47.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.ins.2020.11.009
  • Source: Expert Systems with Applications. Unidade: ICMC

    Subjects: ALGORITMOS GENÉTICOS, JOGOS DE COMPUTADOR, INTERAÇÃO HOMEM-MÁQUINA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PEREIRA, Leonardo Tortoro et al. Procedural generation of dungeons’ maps and locked-door missions through an evolutionary algorithm validated with players. Expert Systems with Applications, v. 180, p. 1-15, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2021.115009. Acesso em: 28 nov. 2025.
    • APA

      Pereira, L. T., Prado, P. V. de S., Lopes, R. M., & Toledo, C. F. M. (2021). Procedural generation of dungeons’ maps and locked-door missions through an evolutionary algorithm validated with players. Expert Systems with Applications, 180, 1-15. doi:10.1016/j.eswa.2021.115009
    • NLM

      Pereira LT, Prado PV de S, Lopes RM, Toledo CFM. Procedural generation of dungeons’ maps and locked-door missions through an evolutionary algorithm validated with players [Internet]. Expert Systems with Applications. 2021 ; 180 1-15.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.eswa.2021.115009
    • Vancouver

      Pereira LT, Prado PV de S, Lopes RM, Toledo CFM. Procedural generation of dungeons’ maps and locked-door missions through an evolutionary algorithm validated with players [Internet]. Expert Systems with Applications. 2021 ; 180 1-15.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1016/j.eswa.2021.115009

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2025