ReP USP - Resultado da busca

Artigo de periodico
Prices of anarchy of selfish 2D bin packing games (2019)
Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: International Journal of Foundations of Computer Science. Unidade: IME
Assunto: TEORIA DOS JOGOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes et al. Prices of anarchy of selfish 2D bin packing games. International Journal of Foundations of Computer Science, v. 30, n. 03, p. 355-374, 2019Tradução . . Disponível em: https://doi.org/10.1142/s0129054119500096. Acesso em: 30 maio 2024.
APA
Fernandes, C. G., Ferreira, C. E., Miyazawa, F. K., & Wakabayashi, Y. (2019). Prices of anarchy of selfish 2D bin packing games. International Journal of Foundations of Computer Science, 30( 03), 355-374. doi:10.1142/s0129054119500096
NLM
Fernandes CG, Ferreira CE, Miyazawa FK, Wakabayashi Y. Prices of anarchy of selfish 2D bin packing games [Internet]. International Journal of Foundations of Computer Science. 2019 ; 30( 03): 355-374.[citado 2024 maio 30 ] Available from: https://doi.org/10.1142/s0129054119500096
Vancouver
Fernandes CG, Ferreira CE, Miyazawa FK, Wakabayashi Y. Prices of anarchy of selfish 2D bin packing games [Internet]. International Journal of Foundations of Computer Science. 2019 ; 30( 03): 355-374.[citado 2024 maio 30 ] Available from: https://doi.org/10.1142/s0129054119500096
Artigo de periodico
Model partitions and compact test case suites (2012)
Bonifacio, Adilson Luiz; Moura, Arnaldo Vieira; Simão, Adenilso da Silva
Source: International Journal of Foundations of Computer Science. Unidade: ICMC
Subjects: ENGENHARIA DE SOFTWARE, SISTEMAS DE INFORMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BONIFACIO, Adilson Luiz e MOURA, Arnaldo Vieira e SIMÃO, Adenilso da Silva. Model partitions and compact test case suites. International Journal of Foundations of Computer Science, v. 23, n. 1, p. 147-172, 2012Tradução . . Disponível em: https://doi.org/10.1142/S0129054112500013. Acesso em: 30 maio 2024.
APA
Bonifacio, A. L., Moura, A. V., & Simão, A. da S. (2012). Model partitions and compact test case suites. International Journal of Foundations of Computer Science, 23( 1), 147-172. doi:10.1142/S0129054112500013
NLM
Bonifacio AL, Moura AV, Simão A da S. Model partitions and compact test case suites [Internet]. International Journal of Foundations of Computer Science. 2012 ; 23( 1): 147-172.[citado 2024 maio 30 ] Available from: https://doi.org/10.1142/S0129054112500013
Vancouver
Bonifacio AL, Moura AV, Simão A da S. Model partitions and compact test case suites [Internet]. International Journal of Foundations of Computer Science. 2012 ; 23( 1): 147-172.[citado 2024 maio 30 ] Available from: https://doi.org/10.1142/S0129054112500013
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
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: 30 maio 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 maio 30 ] 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 maio 30 ] Available from: https://doi.org/10.1142/S0129054111008271
Artigo de periodico
Parallel range minima on coarse grained multicomputers (1999)
Mongelli, Henrique ; Song, Siang Wun
Source: International Journal of Foundations of Computer Science. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MONGELLI, Henrique e SONG, Siang Wun. Parallel range minima on coarse grained multicomputers. International Journal of Foundations of Computer Science, v. 10, n. 4, p. 375-389, 1999Tradução . . Disponível em: https://doi.org/10.1142/S0129054199000277. Acesso em: 30 maio 2024.
APA
Mongelli, H., & Song, S. W. (1999). Parallel range minima on coarse grained multicomputers. International Journal of Foundations of Computer Science, 10( 4), 375-389. doi:10.1142/S0129054199000277
NLM
Mongelli H, Song SW. Parallel range minima on coarse grained multicomputers [Internet]. International Journal of Foundations of Computer Science. 1999 ; 10( 4): 375-389.[citado 2024 maio 30 ] Available from: https://doi.org/10.1142/S0129054199000277
Vancouver
Mongelli H, Song SW. Parallel range minima on coarse grained multicomputers [Internet]. International Journal of Foundations of Computer Science. 1999 ; 10( 4): 375-389.[citado 2024 maio 30 ] Available from: https://doi.org/10.1142/S0129054199000277

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Funding Agencies