ReP USP - Resultado da busca

Artigo de periodico
Graph reduction for QoS prediction of cloud–service compositions (2014)
Ngoko, Yanik; Cerin, Christophe; Goldman, Alfredo
Source: International Journal of Business Process Integration and Management. Unidade: IME
Subjects: COMPUTAÇÃO EM NUVEM, HEURÍSTICA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NGOKO, Yanik e CERIN, Christophe e GOLDMAN, Alfredo. Graph reduction for QoS prediction of cloud–service compositions. International Journal of Business Process Integration and Management, v. 7, n. 2, p. 89-102, 2014Tradução . . Disponível em: https://doi.org/10.1504/IJBPIM.2014.063514. Acesso em: 05 nov. 2024.
APA
Ngoko, Y., Cerin, C., & Goldman, A. (2014). Graph reduction for QoS prediction of cloud–service compositions. International Journal of Business Process Integration and Management, 7( 2), 89-102. doi:10.1504/IJBPIM.2014.063514
NLM
Ngoko Y, Cerin C, Goldman A. Graph reduction for QoS prediction of cloud–service compositions [Internet]. International Journal of Business Process Integration and Management. 2014 ; 7( 2): 89-102.[citado 2024 nov. 05 ] Available from: https://doi.org/10.1504/IJBPIM.2014.063514
Vancouver
Ngoko Y, Cerin C, Goldman A. Graph reduction for QoS prediction of cloud–service compositions [Internet]. International Journal of Business Process Integration and Management. 2014 ; 7( 2): 89-102.[citado 2024 nov. 05 ] Available from: https://doi.org/10.1504/IJBPIM.2014.063514
Trabalho de evento
On graph reduction for QoS prediction of very large web service compositions (2012)
Goldman, Alfredo ; Ngoko, Yanik
Source: Proceedings. Conference titles: International Conference on Services Computing - SCC. Unidade: IME
Subjects: WORLD WIDE WEB, COMPUTABILIDADE E COMPLEXIDADE, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GOLDMAN, Alfredo e NGOKO, Yanik. On graph reduction for QoS prediction of very large web service compositions. 2012, Anais.. Piscataway: IEEE, 2012. Disponível em: https://doi.org/10.1109/SCC.2012.21. Acesso em: 05 nov. 2024.
APA
Goldman, A., & Ngoko, Y. (2012). On graph reduction for QoS prediction of very large web service compositions. In Proceedings. Piscataway: IEEE. doi:10.1109/SCC.2012.21
NLM
Goldman A, Ngoko Y. On graph reduction for QoS prediction of very large web service compositions [Internet]. Proceedings. 2012 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1109/SCC.2012.21
Vancouver
Goldman A, Ngoko Y. On graph reduction for QoS prediction of very large web service compositions [Internet]. Proceedings. 2012 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1109/SCC.2012.21
Trabalho de evento
Formalization of the necessary and sufficient connectivity conditions to the distributed mutual exclusion problem in dynamic networks (2011)
Floriano, Paulo Henrique; Goldman, Alfredo ; Arantes, Luciana
Source: Proceedings. Conference titles: International Symposium on Network Computing and Applications - NCA. Unidade: IME
Subjects: SISTEMAS DISTRIBUÍDOS, TEORIA DOS GRAFOS, ALGORITMOS E ESTRUTURAS DE DADOS, TOPOLOGIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FLORIANO, Paulo Henrique e GOLDMAN, Alfredo e ARANTES, Luciana. Formalization of the necessary and sufficient connectivity conditions to the distributed mutual exclusion problem in dynamic networks. 2011, Anais.. Piscataway: IEEE, 2011. Disponível em: https://doi.org/10.1109/NCA.2011.35. Acesso em: 05 nov. 2024.
APA
Floriano, P. H., Goldman, A., & Arantes, L. (2011). Formalization of the necessary and sufficient connectivity conditions to the distributed mutual exclusion problem in dynamic networks. In Proceedings. Piscataway: IEEE. doi:10.1109/NCA.2011.35
NLM
Floriano PH, Goldman A, Arantes L. Formalization of the necessary and sufficient connectivity conditions to the distributed mutual exclusion problem in dynamic networks [Internet]. Proceedings. 2011 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1109/NCA.2011.35
Vancouver
Floriano PH, Goldman A, Arantes L. Formalization of the necessary and sufficient connectivity conditions to the distributed mutual exclusion problem in dynamic networks [Internet]. Proceedings. 2011 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1109/NCA.2011.35
Trabalho de evento
Performance evaluation of dynamic networks using an evolving graph combinatorial model (2006)
Monteiro, Julian ; Goldman, Alfredo ; Ferreira, Afonso
Source: Proceedings. Conference titles: International Conference on Wireless and Mobile Computing, Networking and Communications - WiMob. Unidade: IME
Subjects: TEORIA DOS GRAFOS, PROCESSOS ESTOCÁSTICOS, COMPUTAÇÃO MÓVEL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MONTEIRO, Julian e GOLDMAN, Alfredo e FERREIRA, Afonso. Performance evaluation of dynamic networks using an evolving graph combinatorial model. 2006, Anais.. Piscataway: IEEE, 2006. Disponível em: https://doi.org/10.1109/WIMOB.2006.1696378. Acesso em: 05 nov. 2024.
APA
Monteiro, J., Goldman, A., & Ferreira, A. (2006). Performance evaluation of dynamic networks using an evolving graph combinatorial model. In Proceedings. Piscataway: IEEE. doi:10.1109/WIMOB.2006.1696378
NLM
Monteiro J, Goldman A, Ferreira A. Performance evaluation of dynamic networks using an evolving graph combinatorial model [Internet]. Proceedings. 2006 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1109/WIMOB.2006.1696378
Vancouver
Monteiro J, Goldman A, Ferreira A. Performance evaluation of dynamic networks using an evolving graph combinatorial model [Internet]. Proceedings. 2006 ;[citado 2024 nov. 05 ] Available from: https://doi.org/10.1109/WIMOB.2006.1696378

USP Schools

ReP

Filtros

Authors

Subjects