ReP USP - Resultado da busca

Filtros : "Estados Unidos" "Financiamento" Limpar

Filtros

Trabalho de evento
A computational method to support chemical product design based on multi-objective optimisation and graph transformers (2023)
Silva, Flávio Soares Corrêa da ; Aslan, Bilal; Nitschke, Geoff
Fonte: Proceedings. Nome do evento: Artificial Life Conference - ALIFE. Unidade: IME
Assuntos: APRENDIZADO COMPUTACIONAL, OTIMIZAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Flávio Soares Corrêa da e ASLAN, Bilal e NITSCHKE, Geoff. A computational method to support chemical product design based on multi-objective optimisation and graph transformers. 2023, Anais.. Cambridge, MA: MIT Press, 2023. Disponível em: https://doi.org/10.1162/isal_a_00602. Acesso em: 14 out. 2024.
APA
Silva, F. S. C. da, Aslan, B., & Nitschke, G. (2023). A computational method to support chemical product design based on multi-objective optimisation and graph transformers. In Proceedings. Cambridge, MA: MIT Press. doi:10.1162/isal_a_00602
NLM
Silva FSC da, Aslan B, Nitschke G. A computational method to support chemical product design based on multi-objective optimisation and graph transformers [Internet]. Proceedings. 2023 ;[citado 2024 out. 14 ] Available from: https://doi.org/10.1162/isal_a_00602
Vancouver
Silva FSC da, Aslan B, Nitschke G. A computational method to support chemical product design based on multi-objective optimisation and graph transformers [Internet]. Proceedings. 2023 ;[citado 2024 out. 14 ] Available from: https://doi.org/10.1162/isal_a_00602
Artigo de periodico
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (2003)
Calinescu, Gruia; Fernandes, Cristina Gomes ; Reed, Bruce A.
Fonte: Journal of Algorithms. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e REED, Bruce A. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, v. 48, n. 2, p. 333-359, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0196-6774(03)00073-7. Acesso em: 14 out. 2024.
APA
Calinescu, G., Fernandes, C. G., & Reed, B. A. (2003). Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, 48( 2), 333-359. doi:10.1016/s0196-6774(03)00073-7
NLM
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 out. 14 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7
Vancouver
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 out. 14 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7

Biblioteca Digital de Produção Intelectual da Universidade de São Paulo 2012 - 2024