ReP USP - Resultado da busca

Trabalho de evento-anais periodico
Multiobjective evolutionary algorithms applied to the optimization of expanded genetic codes (2023)
Silva, Maísa de Carvalho; Pereira, Paulo Guilherme Pinheiro; Oliveira, Lariza Laura de ; Tinós, Renato
Source: Lecture Notes in Computer Science. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: FFCLRP
Subjects: ALGORITMOS GENÉTICOS, OTIMIZAÇÃO COMBINATÓRIA, CÓDIGO GENÉTICO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Maísa de Carvalho et al. Multiobjective evolutionary algorithms applied to the optimization of expanded genetic codes. Lecture Notes in Computer Science. Belo Horizonte: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/978-3-031-45392-2_1. Acesso em: 30 nov. 2025. , 2023
APA
Silva, M. de C., Pereira, P. G. P., Oliveira, L. L. de, & Tinós, R. (2023). Multiobjective evolutionary algorithms applied to the optimization of expanded genetic codes. Lecture Notes in Computer Science. Belo Horizonte: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. doi:10.1007/978-3-031-45392-2_1
NLM
Silva M de C, Pereira PGP, Oliveira LL de, Tinós R. Multiobjective evolutionary algorithms applied to the optimization of expanded genetic codes [Internet]. Lecture Notes in Computer Science. 2023 ; 14197 3-16.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-031-45392-2_1
Vancouver
Silva M de C, Pereira PGP, Oliveira LL de, Tinós R. Multiobjective evolutionary algorithms applied to the optimization of expanded genetic codes [Internet]. Lecture Notes in Computer Science. 2023 ; 14197 3-16.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-031-45392-2_1
Trabalho de evento-anais periodico
A graph-based crossover and soft-repair operators for the steiner tree problem (2021)
Godoi, Giliard Almeida de; Tinós, Renato ; Sanches, Danilo Sipoli
Source: Lecture Notes in Computer Science. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: FFCLRP
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS GENÉTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GODOI, Giliard Almeida de e TINÓS, Renato e SANCHES, Danilo Sipoli. A graph-based crossover and soft-repair operators for the steiner tree problem. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-91702-9_8. Acesso em: 30 nov. 2025. , 2021
APA
Godoi, G. A. de, Tinós, R., & Sanches, D. S. (2021). A graph-based crossover and soft-repair operators for the steiner tree problem. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-030-91702-9_8
NLM
Godoi GA de, Tinós R, Sanches DS. A graph-based crossover and soft-repair operators for the steiner tree problem [Internet]. Lecture Notes in Computer Science. 2021 ; 13073 111-125.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-030-91702-9_8
Vancouver
Godoi GA de, Tinós R, Sanches DS. A graph-based crossover and soft-repair operators for the steiner tree problem [Internet]. Lecture Notes in Computer Science. 2021 ; 13073 111-125.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-030-91702-9_8
Trabalho de evento-anais periodico
A new local search adaptive genetic algorithm for the pseudo-coloring problem (2020)
Contreras, Rodrigo Colnago ; Morandin Junior, Orides ; Viana, Monique Simplicio
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Swarm Intelligence - ICSI. Unidade: ICMC
Subjects: ALGORITMOS GENÉTICOS, VISUALIZAÇÃO, PROCESSAMENTO DE IMAGENS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CONTRERAS, Rodrigo Colnago e MORANDIN JUNIOR, Orides e VIANA, Monique Simplicio. A new local search adaptive genetic algorithm for the pseudo-coloring problem. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-53956-6_31. Acesso em: 30 nov. 2025. , 2020
APA
Contreras, R. C., Morandin Junior, O., & Viana, M. S. (2020). A new local search adaptive genetic algorithm for the pseudo-coloring problem. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-030-53956-6_31
NLM
Contreras RC, Morandin Junior O, Viana MS. A new local search adaptive genetic algorithm for the pseudo-coloring problem [Internet]. Lecture Notes in Computer Science. 2020 ; 12145 349-361.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-030-53956-6_31
Vancouver
Contreras RC, Morandin Junior O, Viana MS. A new local search adaptive genetic algorithm for the pseudo-coloring problem [Internet]. Lecture Notes in Computer Science. 2020 ; 12145 349-361.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-030-53956-6_31
Trabalho de evento-anais periodico
A systematic mapping on high-performance computing for protein structure prediction (2019)
Lopes, Gesiel Rios; Souza, Paulo Sérgio Lopes de ; Delbem, Alexandre Cláudio Botazzo
Source: Lecture Notes in Computer Science. Conference titles: High Performance Computing for Computational Science – VECPAR. Unidade: ICMC
Subjects: BIOINFORMÁTICA, ALGORITMOS GENÉTICOS, PROGRAMAÇÃO PARALELA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LOPES, Gesiel Rios e SOUZA, Paulo Sérgio Lopes de e DELBEM, Alexandre Cláudio Botazzo. A systematic mapping on high-performance computing for protein structure prediction. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-15996-2_6. Acesso em: 30 nov. 2025. , 2019
APA
Lopes, G. R., Souza, P. S. L. de, & Delbem, A. C. B. (2019). A systematic mapping on high-performance computing for protein structure prediction. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-030-15996-2_6
NLM
Lopes GR, Souza PSL de, Delbem ACB. A systematic mapping on high-performance computing for protein structure prediction [Internet]. Lecture Notes in Computer Science. 2019 ; 11333 77-91.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-030-15996-2_6
Vancouver
Lopes GR, Souza PSL de, Delbem ACB. A systematic mapping on high-performance computing for protein structure prediction [Internet]. Lecture Notes in Computer Science. 2019 ; 11333 77-91.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-030-15996-2_6
Trabalho de evento-anais periodico
Optimization of the numeric and categorical attribute weights in KAMILA mixed data clustering algorithm (2019)
Martarelli, Nádia Junqueira; Nagano, Marcelo Seido
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Intelligent Data Engineering and Automated Learning - IDEAL. Unidade: EESC
Subjects: ALGORITMOS GENÉTICOS, XXX
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARTARELLI, Nádia Junqueira e NAGANO, Marcelo Seido. Optimization of the numeric and categorical attribute weights in KAMILA mixed data clustering algorithm. Lecture Notes in Computer Science. Cham, Switzerland: Springer. Disponível em: https://doi.org/10.1007/978-3-030-33607-3_3. Acesso em: 30 nov. 2025. , 2019
APA
Martarelli, N. J., & Nagano, M. S. (2019). Optimization of the numeric and categorical attribute weights in KAMILA mixed data clustering algorithm. Lecture Notes in Computer Science. Cham, Switzerland: Springer. doi:10.1007/978-3-030-33607-3_3
NLM
Martarelli NJ, Nagano MS. Optimization of the numeric and categorical attribute weights in KAMILA mixed data clustering algorithm [Internet]. Lecture Notes in Computer Science. 2019 ; 11871 20-27.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-030-33607-3_3
Vancouver
Martarelli NJ, Nagano MS. Optimization of the numeric and categorical attribute weights in KAMILA mixed data clustering algorithm [Internet]. Lecture Notes in Computer Science. 2019 ; 11871 20-27.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-030-33607-3_3
Trabalho de evento-anais periodico
On the application of bio-inspired algorithms in timetabling problem (2012)
Francisco, Daniela Oliveira; Silva, Ivan Nunes da
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Neural Information Processing - ICONIP. Unidade: EESC
Subjects: SISTEMAS IMUNOLÓGICOS ARTIFICIAIS, ALGORITMOS GENÉTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FRANCISCO, Daniela Oliveira e SILVA, Ivan Nunes da. On the application of bio-inspired algorithms in timetabling problem. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/978-3-642-34487-9_77. Acesso em: 30 nov. 2025. , 2012
APA
Francisco, D. O., & Silva, I. N. da. (2012). On the application of bio-inspired algorithms in timetabling problem. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. doi:10.1007/978-3-642-34487-9_77
NLM
Francisco DO, Silva IN da. On the application of bio-inspired algorithms in timetabling problem [Internet]. Lecture Notes in Computer Science. 2012 ; 7665 637-644.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-642-34487-9_77
Vancouver
Francisco DO, Silva IN da. On the application of bio-inspired algorithms in timetabling problem [Internet]. Lecture Notes in Computer Science. 2012 ; 7665 637-644.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-642-34487-9_77
Trabalho de evento-anais periodico
A model based on genetic algorithm for investigation of the behavior of rats in the elevated plus-maze (2012)
Costa, Ariadne de Andrade; Roque, Antônio Carlos; Morato, Sílvio; Tinós, Renato
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Intelligent Data Engineering and Automated Learning. Unidade: FFCLRP
Subjects: ALGORITMOS GENÉTICOS, MODELOS ANIMAIS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COSTA, Ariadne de Andrade et al. A model based on genetic algorithm for investigation of the behavior of rats in the elevated plus-maze. Lecture Notes in Computer Science. Heidelberg: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. . Acesso em: 30 nov. 2025. , 2012
APA
Costa, A. de A., Roque, A. C., Morato, S., & Tinós, R. (2012). A model based on genetic algorithm for investigation of the behavior of rats in the elevated plus-maze. Lecture Notes in Computer Science. Heidelberg: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo.
NLM
Costa A de A, Roque AC, Morato S, Tinós R. A model based on genetic algorithm for investigation of the behavior of rats in the elevated plus-maze. Lecture Notes in Computer Science. 2012 ; 7435 151-158.[citado 2025 nov. 30 ]
Vancouver
Costa A de A, Roque AC, Morato S, Tinós R. A model based on genetic algorithm for investigation of the behavior of rats in the elevated plus-maze. Lecture Notes in Computer Science. 2012 ; 7435 151-158.[citado 2025 nov. 30 ]
Trabalho de evento-anais periodico
A method to generate artificial 2D shape contour based in Fourier transform and genetic algorithms (2011)
Falvo, Maurício; Florindo, João Batista; Bruno, Odemir Martinez
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Advanced Concepts for Intelligent Vision Systems - ACIVS. Unidade: IFSC
Subjects: TRANSFORMADA DE FOURIER, ALGORITMOS GENÉTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FALVO, Maurício e FLORINDO, João Batista e BRUNO, Odemir Martinez. A method to generate artificial 2D shape contour based in Fourier transform and genetic algorithms. Lecture Notes in Computer Science. Heidelberg: Springer. Disponível em: https://doi.org/10.1007/978-3-642-23687-7_19. Acesso em: 30 nov. 2025. , 2011
APA
Falvo, M., Florindo, J. B., & Bruno, O. M. (2011). A method to generate artificial 2D shape contour based in Fourier transform and genetic algorithms. Lecture Notes in Computer Science. Heidelberg: Springer. doi:10.1007/978-3-642-23687-7_19
NLM
Falvo M, Florindo JB, Bruno OM. A method to generate artificial 2D shape contour based in Fourier transform and genetic algorithms [Internet]. Lecture Notes in Computer Science. 2011 ; 6915 207-215.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-642-23687-7_19
Vancouver
Falvo M, Florindo JB, Bruno OM. A method to generate artificial 2D shape contour based in Fourier transform and genetic algorithms [Internet]. Lecture Notes in Computer Science. 2011 ; 6915 207-215.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-642-23687-7_19
Trabalho de evento-anais periodico
Neurogenetic approach for solving dynamic programming problems (2010)
Pires, Matheus Giovanni; Silva, Ivan Nunes da
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Artifical Intelligence and Soft Computing. Unidade: EESC
Subjects: ALGORITMOS GENÉTICOS, PROGRAMAÇÃO DINÂMICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PIRES, Matheus Giovanni e SILVA, Ivan Nunes da. Neurogenetic approach for solving dynamic programming problems. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/978-3-642-13232-2_10. Acesso em: 30 nov. 2025. , 2010
APA
Pires, M. G., & Silva, I. N. da. (2010). Neurogenetic approach for solving dynamic programming problems. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. doi:10.1007/978-3-642-13232-2_10
NLM
Pires MG, Silva IN da. Neurogenetic approach for solving dynamic programming problems [Internet]. Lecture Notes in Computer Science. 2010 ; 6114 72-79.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-642-13232-2_10
Vancouver
Pires MG, Silva IN da. Neurogenetic approach for solving dynamic programming problems [Internet]. Lecture Notes in Computer Science. 2010 ; 6114 72-79.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-642-13232-2_10
Trabalho de evento-anais periodico
Hybrid Hopfield architecture for solving nonlinear programming problems (2009)
Bertoni, Fabiana Cristina; Silva, Ivan Nunes da
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Neural Information Processing. Unidade: EESC
Subjects: ALGORITMOS GENÉTICOS, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BERTONI, Fabiana Cristina e SILVA, Ivan Nunes da. Hybrid Hopfield architecture for solving nonlinear programming problems. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/978-3-642-10677-4_30. Acesso em: 30 nov. 2025. , 2009
APA
Bertoni, F. C., & Silva, I. N. da. (2009). Hybrid Hopfield architecture for solving nonlinear programming problems. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. doi:10.1007/978-3-642-10677-4_30
NLM
Bertoni FC, Silva IN da. Hybrid Hopfield architecture for solving nonlinear programming problems [Internet]. Lecture Notes in Computer Science. 2009 ; 5863 267-276.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-642-10677-4_30
Vancouver
Bertoni FC, Silva IN da. Hybrid Hopfield architecture for solving nonlinear programming problems [Internet]. Lecture Notes in Computer Science. 2009 ; 5863 267-276.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-642-10677-4_30
Trabalho de evento-anais periodico
Evolutionary clustering search for flowtime minimization in permutation flow shop (2007)
Ribeiro Filho, Geraldo; Nagano, Marcelo Seido ; Lorena, Luiz Antonio Nogueira
Source: Lecture Notes in Computer Science. Conference titles: International Workshop, HM 2007. Unidade: EESC
Subjects: CLUSTERS, ALGORITMOS GENÉTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RIBEIRO FILHO, Geraldo e NAGANO, Marcelo Seido e LORENA, Luiz Antonio Nogueira. Evolutionary clustering search for flowtime minimization in permutation flow shop. Lecture Notes in Computer Science. Heidelberg, Germany: Escola de Engenharia de São Carlos, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/978-3-540-75514-2_6. Acesso em: 30 nov. 2025. , 2007
APA
Ribeiro Filho, G., Nagano, M. S., & Lorena, L. A. N. (2007). Evolutionary clustering search for flowtime minimization in permutation flow shop. Lecture Notes in Computer Science. Heidelberg, Germany: Escola de Engenharia de São Carlos, Universidade de São Paulo. doi:10.1007/978-3-540-75514-2_6
NLM
Ribeiro Filho G, Nagano MS, Lorena LAN. Evolutionary clustering search for flowtime minimization in permutation flow shop [Internet]. Lecture Notes in Computer Science. 2007 ; 4771 69-81.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-540-75514-2_6
Vancouver
Ribeiro Filho G, Nagano MS, Lorena LAN. Evolutionary clustering search for flowtime minimization in permutation flow shop [Internet]. Lecture Notes in Computer Science. 2007 ; 4771 69-81.[citado 2025 nov. 30 ] Available from: https://doi.org/10.1007/978-3-540-75514-2_6

USP Schools

ReP

Filtros

Departament

Authors

USP affiliated authors

Date published

Subjects

Conference titles

Funding Agencies

Indexado em

Non normalized affiliation