Sensing trees in smart cities with open-design hardware (2018)
- Authors:
- Autor USP: LEJBMAN, ALFREDO GOLDMAN VEL - IME
- Unidade: IME
- DOI: 10.1109/NCA.2018.8548274
- Subjects: CIDADES INTELIGENTES; INTERNET DAS COISAS; BIG DATA; TRANSPIRAÇÃO VEGETAL
- Keywords: open-design hardware; edge computing; evapotranspiration
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: IEEE
- Publisher place: Piscataway
- Date published: 2018
- Source:
- Título: Proceedings
- Conference titles: International Symposium on Network Computing and Applications - NCA
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
CARVALHO JUNIOR, Antonio Deusany de e HARIKI, Victor Seiji e GOLDMAN, Alfredo. Sensing trees in smart cities with open-design hardware. 2018, Anais.. Piscataway: IEEE, 2018. Disponível em: https://doi.org/10.1109/NCA.2018.8548274. Acesso em: 03 jan. 2026. -
APA
Carvalho Junior, A. D. de, Hariki, V. S., & Goldman, A. (2018). Sensing trees in smart cities with open-design hardware. In Proceedings. Piscataway: IEEE. doi:10.1109/NCA.2018.8548274 -
NLM
Carvalho Junior AD de, Hariki VS, Goldman A. Sensing trees in smart cities with open-design hardware [Internet]. Proceedings. 2018 ;[citado 2026 jan. 03 ] Available from: https://doi.org/10.1109/NCA.2018.8548274 -
Vancouver
Carvalho Junior AD de, Hariki VS, Goldman A. Sensing trees in smart cities with open-design hardware [Internet]. Proceedings. 2018 ;[citado 2026 jan. 03 ] Available from: https://doi.org/10.1109/NCA.2018.8548274 - 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
- 1-optimality of static BSP computations: scheduling independent chains as a case study
- Condições de conectividade de algoritmos de exclusão mútua em redes dinâmicas
- Preface: Agile processes in software engineering and extreme programming - Workshop: XP 2024
Informações sobre o DOI: 10.1109/NCA.2018.8548274 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2933957.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
