ReP USP - Resultado da busca

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: 17 out. 2024. , 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 2024 out. 17 ] 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 2024 out. 17 ] Available from: https://doi.org/10.1007/978-3-030-33607-3_3
Artigo de periodico
An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem (2010)
Araújo, Daniella Castro; Nagano, Marcelo Seido
Source: Lecture Notes in Computer Science. Unidade: EESC
Subjects: HEURÍSTICA, ALGORITMOS DE SCHEDULING, ANÁLISE ESTATÍSTICA DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARAÚJO, Daniella Castro e NAGANO, Marcelo Seido. An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem. Lecture Notes in Computer Science, v. 6437, p. 187-196, 2010Tradução . . Disponível em: https://doi.org/10.1007/978-3-642-16761-4_17. Acesso em: 17 out. 2024.
APA
Araújo, D. C., & Nagano, M. S. (2010). An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem. Lecture Notes in Computer Science, 6437, 187-196. doi:10.1007/978-3-642-16761-4_17
NLM
Araújo DC, Nagano MS. An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem [Internet]. Lecture Notes in Computer Science. 2010 ; 6437 187-196.[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/978-3-642-16761-4_17
Vancouver
Araújo DC, Nagano MS. An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem [Internet]. Lecture Notes in Computer Science. 2010 ; 6437 187-196.[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/978-3-642-16761-4_17
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: 17 out. 2024. , 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 2024 out. 17 ] 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 2024 out. 17 ] Available from: https://doi.org/10.1007/978-3-540-75514-2_6
Artigo de periodico
Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling (2007)
Ribeiro Filho, Geraldo; Nagano, Marcelo Seido; Lorena, Luiz Antonio Nogueira
Source: Lecture Notes in Computer Science. Unidade: EESC
Subjects: HEURÍSTICA, ALGORITMOS DE SCHEDULING
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. Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling. Lecture Notes in Computer Science, v. 4827, p. 1099-1109, 2007Tradução . . Disponível em: https://doi.org/10.1007/978-3-540-76631-5_105. Acesso em: 17 out. 2024.
APA
Ribeiro Filho, G., Nagano, M. S., & Lorena, L. A. N. (2007). Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling. Lecture Notes in Computer Science, 4827, 1099-1109. doi:10.1007/978-3-540-76631-5_105
NLM
Ribeiro Filho G, Nagano MS, Lorena LAN. Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling [Internet]. Lecture Notes in Computer Science. 2007 ; 4827 1099-1109.[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/978-3-540-76631-5_105
Vancouver
Ribeiro Filho G, Nagano MS, Lorena LAN. Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling [Internet]. Lecture Notes in Computer Science. 2007 ; 4827 1099-1109.[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/978-3-540-76631-5_105

USP Schools

ReP

Filtros

Subjects