Thematic series on service composition for the future internet (2016)
- Authors:
- Autor USP: LEJBMAN, ALFREDO GOLDMAN VEL - IME
- Unidade: IME
- DOI: 10.1186/s13174-016-0045-9
- Subjects: INTERNET; CIÊNCIA DA COMPUTAÇÃO
- Language: Inglês
- Imprenta:
- Publisher place: Heidelberg
- Date published: 2016
- Source:
- Título: Journal of Internet Services and Applications
- ISSN: 1869-0238
- Volume/Número/Paginação/Ano: v. 7, n. 1, 4 p., article n.º 3, Dec. 2016
- Este periódico é de acesso aberto
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: gold
- Licença: cc-by-nc
-
ABNT
AUTILI, Marco e TIVOLI, Massimo e GOLDMAN, Alfredo. Thematic series on service composition for the future internet. Journal of Internet Services and Applications. Heidelberg: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1186/s13174-016-0045-9. Acesso em: 24 dez. 2025. , 2016 -
APA
Autili, M., Tivoli, M., & Goldman, A. (2016). Thematic series on service composition for the future internet. Journal of Internet Services and Applications. Heidelberg: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1186/s13174-016-0045-9 -
NLM
Autili M, Tivoli M, Goldman A. Thematic series on service composition for the future internet [Internet]. Journal of Internet Services and Applications. 2016 ; 7( article º 3): 4 .[citado 2025 dez. 24 ] Available from: https://doi.org/10.1186/s13174-016-0045-9 -
Vancouver
Autili M, Tivoli M, Goldman A. Thematic series on service composition for the future internet [Internet]. Journal of Internet Services and Applications. 2016 ; 7( article º 3): 4 .[citado 2025 dez. 24 ] Available from: https://doi.org/10.1186/s13174-016-0045-9 - A model for parallel job schedulling on dynamical computer grids
- Exchanging messages of different sizes
- Combining parallel algorithms solving the same application: what is the best approach?
- Actor scheduling for multicore hierarchical memory platforms
- Scheduling with duplication on m processors with small communication delays
- A MILP approach to schedule parallel independent tasks
- A delay-tolerant network routing algorithm based on column generation
- Boosting Task Scheduling Data Locality with Low-latency, HW-accelerated Label Propagation
- Preface: Agile processes in software engineering and extreme programming - Workshop: XP 2024
- A model for parallel job scheduling on dynamic computer grids
Informações sobre o DOI: 10.1186/s13174-016-0045-9 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
