Menu

Filtros : "Goldman, Alfredo" "ALGORITMOS" Removido: "BIG DATA" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Trabalho de evento

    Malleable resource sharing algorithms for cooperative resolution of problems (2012)

    Goldman, Alfredo ; Ngoko, Yanik; Trystram, Denis

    Source: Proceedings. Conference titles: IEEE Congress on Evolutionary Computation - CEC. Unidade: IME

    Subjects: ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA

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

    • ABNT

      GOLDMAN, Alfredo e NGOKO, Yanik e TRYSTRAM, Denis. Malleable resource sharing algorithms for cooperative resolution of problems. 2012, Anais.. Piscataway: IEEE, 2012. Disponível em: https://doi.org/10.1109/CEC.2012.6256524. Acesso em: 03 out. 2024.

    • APA

      Goldman, A., Ngoko, Y., & Trystram, D. (2012). Malleable resource sharing algorithms for cooperative resolution of problems. In Proceedings. Piscataway: IEEE. doi:10.1109/CEC.2012.6256524

    • NLM

      Goldman A, Ngoko Y, Trystram D. Malleable resource sharing algorithms for cooperative resolution of problems [Internet]. Proceedings. 2012 ;[citado 2024 out. 03 ] Available from: https://doi.org/10.1109/CEC.2012.6256524

    • Vancouver

      Goldman A, Ngoko Y, Trystram D. Malleable resource sharing algorithms for cooperative resolution of problems [Internet]. Proceedings. 2012 ;[citado 2024 out. 03 ] Available from: https://doi.org/10.1109/CEC.2012.6256524

  • Trabalho de evento-resumo periodico

    Approximating the discrete resource sharing scheduling problem (2011)

    Bougeret, Marin; Dutot, Pierre-Francois; Goldman, Alfredo ; Ngoko, Yanik; Trystram, Denis

    Source: International Journal of Foundations of Computer Science. Conference titles: Workshop on Advances in Parallel and Distributed Computational Models - APDCM. Unidade: IME

    Assunto: ALGORITMOS

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

    • ABNT

      BOUGERET, Marin et al. Approximating the discrete resource sharing scheduling problem. International Journal of Foundations of Computer Science. Singapore: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1142/S0129054111008271. Acesso em: 03 out. 2024. , 2011

    • APA

      Bougeret, M., Dutot, P. -F., Goldman, A., Ngoko, Y., & Trystram, D. (2011). Approximating the discrete resource sharing scheduling problem. International Journal of Foundations of Computer Science. Singapore: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1142/S0129054111008271

    • NLM

      Bougeret M, Dutot P-F, Goldman A, Ngoko Y, Trystram D. Approximating the discrete resource sharing scheduling problem [Internet]. International Journal of Foundations of Computer Science. 2011 ; 22( 3): 639-656.[citado 2024 out. 03 ] Available from: https://doi.org/10.1142/S0129054111008271

    • Vancouver

      Bougeret M, Dutot P-F, Goldman A, Ngoko Y, Trystram D. Approximating the discrete resource sharing scheduling problem [Internet]. International Journal of Foundations of Computer Science. 2011 ; 22( 3): 639-656.[citado 2024 out. 03 ] Available from: https://doi.org/10.1142/S0129054111008271
  • 1

1 - 2 (2 records)

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