Menu

Filtros : "ALGORITMOS" "Financiamento FUNDECT" Limpar

Filtros

Refine with date range

  • 1

1 - 3 (3 records)

  • Trabalho de evento

    Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components (2010)

    Cáceres, Edson Norberto; Mongelli, Henrique; Nishibe, Christiane; Song, Siang Wun

    Source: Proceedings. Conference titles: International conference on High Peformance Computing and Simulation - HPCS. Unidade: IME

    Subjects: ALGORITMOS, ALGORITMOS PARA PROCESSAMENTO, TEORIA DOS GRAFOS

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

    • ABNT

      CÁCERES, Edson Norberto et al. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. 2010, Anais.. Piscataway: IEEE, 2010. Disponível em: https://doi.org/10.1109/HPCS.2010.5547062. Acesso em: 28 nov. 2025.

    • APA

      Cáceres, E. N., Mongelli, H., Nishibe, C., & Song, S. W. (2010). Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. In Proceedings. Piscataway: IEEE. doi:10.1109/HPCS.2010.5547062

    • NLM

      Cáceres EN, Mongelli H, Nishibe C, Song SW. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2010 ;[citado 2025 nov. 28 ] Available from: https://doi.org/10.1109/HPCS.2010.5547062

    • Vancouver

      Cáceres EN, Mongelli H, Nishibe C, Song SW. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2010 ;[citado 2025 nov. 28 ] Available from: https://doi.org/10.1109/HPCS.2010.5547062

  • Artigo de periodico

    Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search (2010)

    Cáceres, Edson Norberto; Song, Siang Wun; Szwarcfiter, Jayme Luiz

    Source: RAIRO: Theoretical Informatics and Applications. Unidade: IME

    Assunto: ALGORITMOS

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

    • ABNT

      CÁCERES, Edson Norberto e SONG, Siang Wun e SZWARCFITER, Jayme Luiz. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search. RAIRO: Theoretical Informatics and Applications, v. 44, n. 3, p. 293-312, 2010Tradução . . Disponível em: https://doi.org/10.1051/ita/2010016. Acesso em: 28 nov. 2025.

    • APA

      Cáceres, E. N., Song, S. W., & Szwarcfiter, J. L. (2010). Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search. RAIRO: Theoretical Informatics and Applications, 44( 3), 293-312. doi:10.1051/ita/2010016

    • NLM

      Cáceres EN, Song SW, Szwarcfiter JL. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search [Internet]. RAIRO: Theoretical Informatics and Applications. 2010 ; 44( 3): 293-312.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1051/ita/2010016

    • Vancouver

      Cáceres EN, Song SW, Szwarcfiter JL. Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search [Internet]. RAIRO: Theoretical Informatics and Applications. 2010 ; 44( 3): 293-312.[citado 2025 nov. 28 ] Available from: https://doi.org/10.1051/ita/2010016

  • Trabalho de evento

    A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers (2006)

    Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto ; Song, Siang Wun

    Source: Proceedings. Conference titles: European Conference on Parallel Processing - Euro-Par. Unidade: IME

    Subjects: TEORIA DA INFORMAÇÃO, TEORIA DOS NÚMEROS, ALGORITMOS

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

    • ABNT

      ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers. 2006, Anais.. Berlin: Springer, 2006. Disponível em: https://doi.org/10.1007/11823285_87. Acesso em: 28 nov. 2025.

    • APA

      Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2006). A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers. In Proceedings. Berlin: Springer. doi:10.1007/11823285_87

    • NLM

      Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers [Internet]. Proceedings. 2006 ;[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/11823285_87

    • Vancouver

      Alves CER, Cáceres EN, Song SW. A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers [Internet]. Proceedings. 2006 ;[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/11823285_87
  • 1

1 - 3 (3 records)

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