Menu

Filtros : "Inglaterra" "Áustria" Removidos: "SAUDE AMBIENTAL" "NEOPLASIAS" "1984" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    Optimizing security and cost of workflow execution using task annotation and genetic-based algorithm (2021)

    Shishido, Henrique Yoshikazu ; Estrella, Júlio Cezar ; Toledo, Claudio Fabiano Motta ; Reiff-Marganiec, Stephan

    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: 24 jul. 2024.

    • 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 2024 jul. 24 ] 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 2024 jul. 24 ] Available from: https://doi.org/10.1007/s00607-021-00943-9

  • Artigo de periodico

    Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm (2017)

    Constantino, Ademir Aparecido; Mendonça Neto, Candido Ferreira Xavier de; Araujo, Silvio Alexandre de; Landa-Silva, Dario; Calvi, Rogério; Santos, Allainclair Flausino dos

    Source: Journal of Universal Computer Science. Unidade: EACH

    Subjects: GERENCIAMENTO DE TRANSPORTES, HEURÍSTICA, ALGORITMOS

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

    • ABNT

      CONSTANTINO, Ademir Aparecido et al. Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm. Journal of Universal Computer Science, v. 23, n. 5, p. 479-504, 2017Tradução . . Disponível em: http://www.jucs.org/jucs_23_5/solving_a_large_real/jucs_23_05_0479_0504_constantino.pdf. Acesso em: 24 jul. 2024.

    • APA

      Constantino, A. A., Mendonça Neto, C. F. X. de, Araujo, S. A. de, Landa-Silva, D., Calvi, R., & Santos, A. F. dos. (2017). Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm. Journal of Universal Computer Science, 23( 5), 479-504. Recuperado de http://www.jucs.org/jucs_23_5/solving_a_large_real/jucs_23_05_0479_0504_constantino.pdf

    • NLM

      Constantino AA, Mendonça Neto CFX de, Araujo SA de, Landa-Silva D, Calvi R, Santos AF dos. Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm [Internet]. Journal of Universal Computer Science. 2017 ; 23( 5): 479-504.[citado 2024 jul. 24 ] Available from: http://www.jucs.org/jucs_23_5/solving_a_large_real/jucs_23_05_0479_0504_constantino.pdf

    • Vancouver

      Constantino AA, Mendonça Neto CFX de, Araujo SA de, Landa-Silva D, Calvi R, Santos AF dos. Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm [Internet]. Journal of Universal Computer Science. 2017 ; 23( 5): 479-504.[citado 2024 jul. 24 ] Available from: http://www.jucs.org/jucs_23_5/solving_a_large_real/jucs_23_05_0479_0504_constantino.pdf
  • 1

1 - 2 (2 records)

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