ReP USP - Resultado da busca

Filtros : "LEJBMAN, ALFREDO GOLDMAN VEL" "Indexado no ISI Web of Knowledge" Removido: "2010" Limpar

Filtros

Artigo de periodico
Adaptive fault tolerance mechanisms for opportunistic environments: a mobile agent approach (2011)
Pinheiro, Vinicius Gama; Goldman, Alfredo ; Kon, Fábio
Source: Concurrency and Computation: Practice and Experience. Unidade: IME
Assunto: SOFTWARES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PINHEIRO, Vinicius Gama e GOLDMAN, Alfredo e KON, Fábio. Adaptive fault tolerance mechanisms for opportunistic environments: a mobile agent approach. Concurrency and Computation: Practice and Experience, v. 23, n. 17, p. 2078-2091, 2011Tradução . . Disponível em: https://doi.org/10.1002/cpe.1706. Acesso em: 27 nov. 2025.
APA
Pinheiro, V. G., Goldman, A., & Kon, F. (2011). Adaptive fault tolerance mechanisms for opportunistic environments: a mobile agent approach. Concurrency and Computation: Practice and Experience, 23( 17), 2078-2091. doi:10.1002/cpe.1706
NLM
Pinheiro VG, Goldman A, Kon F. Adaptive fault tolerance mechanisms for opportunistic environments: a mobile agent approach [Internet]. Concurrency and Computation: Practice and Experience. 2011 ; 23( 17): 2078-2091.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/cpe.1706
Vancouver
Pinheiro VG, Goldman A, Kon F. Adaptive fault tolerance mechanisms for opportunistic environments: a mobile agent approach [Internet]. Concurrency and Computation: Practice and Experience. 2011 ; 23( 17): 2078-2091.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/cpe.1706
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: 27 nov. 2025. , 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 2025 nov. 27 ] 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 2025 nov. 27 ] Available from: https://doi.org/10.1142/S0129054111008271

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