A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
WAKABAYASHI, Yoshiko. Selfish 2D bin packing game. 2017, Anais.. São Paulo: Sociedade Brasileira de Computação, 2017. Disponível em: http://csbc2017.mackenzie.br/anais. Acesso em: 18 ago. 2024.
APA
Wakabayashi, Y. (2017). Selfish 2D bin packing game. In Anais. São Paulo: Sociedade Brasileira de Computação. Recuperado de http://csbc2017.mackenzie.br/anais
NLM
Wakabayashi Y. Selfish 2D bin packing game [Internet]. Anais. 2017 ;[citado 2024 ago. 18 ] Available from: http://csbc2017.mackenzie.br/anais
Vancouver
Wakabayashi Y. Selfish 2D bin packing game [Internet]. Anais. 2017 ;[citado 2024 ago. 18 ] Available from: http://csbc2017.mackenzie.br/anais
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, Thiago Pereira et al. Markov decision processes specified by probabilistic logic programming: representation and solution. 2017, Anais.. Piscataway: IEEE, 2017. Disponível em: https://doi.org/10.1109/BRACIS.2016.068. Acesso em: 18 ago. 2024.
APA
Bueno, T. P., Mauá, D. D., Barros, L. N. de, & Cozman, F. G. (2017). Markov decision processes specified by probabilistic logic programming: representation and solution. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2016.068
NLM
Bueno TP, Mauá DD, Barros LN de, Cozman FG. Markov decision processes specified by probabilistic logic programming: representation and solution [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.1109/BRACIS.2016.068
Vancouver
Bueno TP, Mauá DD, Barros LN de, Cozman FG. Markov decision processes specified by probabilistic logic programming: representation and solution [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.1109/BRACIS.2016.068
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
YANCY-CABALLERO, Daison et al. Mineral particles in sugar cane bagasse: localization and morphometry using microtomography analysis. Energy & Fuels, v. 31, n. 11, p. 12288-12296, 2017Tradução . . Disponível em: https://doi.org/10.1021/acs.energyfuels.7b02247. Acesso em: 18 ago. 2024.
APA
Yancy-Caballero, D., Ling, L. Y., Archilha, N. L., Ferreira, J. E., & Driemeier, C. (2017). Mineral particles in sugar cane bagasse: localization and morphometry using microtomography analysis. Energy & Fuels, 31( 11), 12288-12296. doi:10.1021/acs.energyfuels.7b02247
NLM
Yancy-Caballero D, Ling LY, Archilha NL, Ferreira JE, Driemeier C. Mineral particles in sugar cane bagasse: localization and morphometry using microtomography analysis [Internet]. Energy & Fuels. 2017 ; 31( 11): 12288-12296.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1021/acs.energyfuels.7b02247
Vancouver
Yancy-Caballero D, Ling LY, Archilha NL, Ferreira JE, Driemeier C. Mineral particles in sugar cane bagasse: localization and morphometry using microtomography analysis [Internet]. Energy & Fuels. 2017 ; 31( 11): 12288-12296.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1021/acs.energyfuels.7b02247
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Chromatic thresholds in dense random graphs. Random Structures & Algorithms, v. 51, n. 2, p. 185-214, 2017Tradução . . Disponível em: https://doi.org/10.1002/rsa.20708. Acesso em: 18 ago. 2024.
APA
Allen, P., Böttcher, J., Griffiths, S., Kohayakawa, Y., & Morris, R. (2017). Chromatic thresholds in dense random graphs. Random Structures & Algorithms, 51( 2), 185-214. doi:10.1002/rsa.20708
NLM
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in dense random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 185-214.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1002/rsa.20708
Vancouver
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in dense random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 185-214.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1002/rsa.20708
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDRÉS, Ignasi e BARROS, Leliane Nunes de. Using the causal graph to enhance translations to solve contingent planning problems. 2017, Anais.. Piscataway: IEEE, 2017. Disponível em: https://doi.org/10.1109/BRACIS.2016.023. Acesso em: 18 ago. 2024.
APA
Andrés, I., & Barros, L. N. de. (2017). Using the causal graph to enhance translations to solve contingent planning problems. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2016.023
NLM
Andrés I, Barros LN de. Using the causal graph to enhance translations to solve contingent planning problems [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.1109/BRACIS.2016.023
Vancouver
Andrés I, Barros LN de. Using the causal graph to enhance translations to solve contingent planning problems [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.1109/BRACIS.2016.023
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Shayenne da Luz e QUEIROZ, Marcelo Gomes de. Melody and accompaniment separation using enhanced binary masks. 2017, Anais.. Porto Alegre: SBC, 2017. Disponível em: http://compmus.ime.usp.br/sbcm/2017/assets/SBCM2017Proceedings.pdf. Acesso em: 18 ago. 2024.
APA
Moura, S. da L., & Queiroz, M. G. de. (2017). Melody and accompaniment separation using enhanced binary masks. In Proceedings. Porto Alegre: SBC. Recuperado de http://compmus.ime.usp.br/sbcm/2017/assets/SBCM2017Proceedings.pdf
NLM
Moura S da L, Queiroz MG de. Melody and accompaniment separation using enhanced binary masks [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: http://compmus.ime.usp.br/sbcm/2017/assets/SBCM2017Proceedings.pdf
Vancouver
Moura S da L, Queiroz MG de. Melody and accompaniment separation using enhanced binary masks [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: http://compmus.ime.usp.br/sbcm/2017/assets/SBCM2017Proceedings.pdf
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Flávio Soares Corrêa da et al. Hazard prevention in mission plans for aerial vehicles based on soft institutions. Civil Aircraft Design and Research, n. 3, p. 105-116, 2017Tradução . . Disponível em: http://myfjcs.cnjournals.com/myfjsjyyj/article/abstract/20170318. Acesso em: 18 ago. 2024.
APA
Silva, F. S. C. da, Chung, P. W. H., Zuffo, M. K., Papapanagiotou, P., Robertson, D. S., & Vasconcelos, W. (2017). Hazard prevention in mission plans for aerial vehicles based on soft institutions. Civil Aircraft Design and Research, ( 3), 105-116. Recuperado de http://myfjcs.cnjournals.com/myfjsjyyj/article/abstract/20170318
NLM
Silva FSC da, Chung PWH, Zuffo MK, Papapanagiotou P, Robertson DS, Vasconcelos W. Hazard prevention in mission plans for aerial vehicles based on soft institutions [Internet]. Civil Aircraft Design and Research. 2017 ;( 3): 105-116.[citado 2024 ago. 18 ] Available from: http://myfjcs.cnjournals.com/myfjsjyyj/article/abstract/20170318
Vancouver
Silva FSC da, Chung PWH, Zuffo MK, Papapanagiotou P, Robertson DS, Vasconcelos W. Hazard prevention in mission plans for aerial vehicles based on soft institutions [Internet]. Civil Aircraft Design and Research. 2017 ;( 3): 105-116.[citado 2024 ago. 18 ] Available from: http://myfjcs.cnjournals.com/myfjsjyyj/article/abstract/20170318
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CERIOLI, Márcia R et al. Transversals of longest paths. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2017.10.024. Acesso em: 18 ago. 2024. , 2017
APA
Cerioli, M. R., Fernandes, C. G., Gómez, R., Gutiérrez, J., & Lima, P. T. (2017). Transversals of longest paths. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2017.10.024
NLM
Cerioli MR, Fernandes CG, Gómez R, Gutiérrez J, Lima PT. Transversals of longest paths [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 135-140.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.endm.2017.10.024
Vancouver
Cerioli MR, Fernandes CG, Gómez R, Gutiérrez J, Lima PT. Transversals of longest paths [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 135-140.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.endm.2017.10.024
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2017.10.017. Acesso em: 18 ago. 2024. , 2017
APA
Moura, P. F. S., & Wakabayashi, Y. (2017). Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2017.10.017
NLM
Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017
Vancouver
Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CONDORI, Marcos Ademir Tejada et al. Extending the differential image foresting transform to root-based path-cost functions with application to superpixel segmentation. 2017, Anais.. Los Alamitos: IEEE, 2017. Disponível em: https://doi.org/10.1109/SIBGRAPI.2017.8. Acesso em: 18 ago. 2024.
APA
Condori, M. A. T., Cappabianco, F. A. M., Falcão, A. X., & Miranda, P. A. V. de. (2017). Extending the differential image foresting transform to root-based path-cost functions with application to superpixel segmentation. In Proceedings. Los Alamitos: IEEE. doi:10.1109/SIBGRAPI.2017.8
NLM
Condori MAT, Cappabianco FAM, Falcão AX, Miranda PAV de. Extending the differential image foresting transform to root-based path-cost functions with application to superpixel segmentation [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.1109/SIBGRAPI.2017.8
Vancouver
Condori MAT, Cappabianco FAM, Falcão AX, Miranda PAV de. Extending the differential image foresting transform to root-based path-cost functions with application to superpixel segmentation [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.1109/SIBGRAPI.2017.8
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NICHIATA, Lucia Yasuko Izumi et al. Aplicativo de autogestão do cuidado de pessoas em Profilaxia Pós-Exposição ao HIV (PEP), com interface para a gestão do Programa de DST/Aids da Secretaria Municipal da Saúde de São Paulo. 2017, Anais.. São Paulo: PM DST/Aids/SMS/SP, 2017. Disponível em: https://repositorio.usp.br/directbitstream/3b6cf18a-c308-44e5-a7e1-ea5dbece6d8b/2869101.pdf. Acesso em: 18 ago. 2024.
APA
Nichiata, L. Y. I., Fracolli, L. A., Barbosa, B. J., Silva, M. M., Silva, F. S. C. da, Abbate, M. C., et al. (2017). Aplicativo de autogestão do cuidado de pessoas em Profilaxia Pós-Exposição ao HIV (PEP), com interface para a gestão do Programa de DST/Aids da Secretaria Municipal da Saúde de São Paulo. In XII Inventário de Pesquisas em IST/Aids. São Paulo: PM DST/Aids/SMS/SP. Recuperado de https://repositorio.usp.br/directbitstream/3b6cf18a-c308-44e5-a7e1-ea5dbece6d8b/2869101.pdf
NLM
Nichiata LYI, Fracolli LA, Barbosa BJ, Silva MM, Silva FSC da, Abbate MC, Camargo RF de, Goulart CEG. Aplicativo de autogestão do cuidado de pessoas em Profilaxia Pós-Exposição ao HIV (PEP), com interface para a gestão do Programa de DST/Aids da Secretaria Municipal da Saúde de São Paulo [Internet]. XII Inventário de Pesquisas em IST/Aids. 2017 ;[citado 2024 ago. 18 ] Available from: https://repositorio.usp.br/directbitstream/3b6cf18a-c308-44e5-a7e1-ea5dbece6d8b/2869101.pdf
Vancouver
Nichiata LYI, Fracolli LA, Barbosa BJ, Silva MM, Silva FSC da, Abbate MC, Camargo RF de, Goulart CEG. Aplicativo de autogestão do cuidado de pessoas em Profilaxia Pós-Exposição ao HIV (PEP), com interface para a gestão do Programa de DST/Aids da Secretaria Municipal da Saúde de São Paulo [Internet]. XII Inventário de Pesquisas em IST/Aids. 2017 ;[citado 2024 ago. 18 ] Available from: https://repositorio.usp.br/directbitstream/3b6cf18a-c308-44e5-a7e1-ea5dbece6d8b/2869101.pdf
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MORIMITSU, Henrique e BLOCH, Isabelle e CÉSAR JÚNIOR, Roberto Marcondes. Exploring structure for long-term tracking of multiple objects in sports videos. Computer Vision and Image Understanding, v. 159, p. 89-104, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.cviu.2016.12.003. Acesso em: 18 ago. 2024.
APA
Morimitsu, H., Bloch, I., & César Júnior, R. M. (2017). Exploring structure for long-term tracking of multiple objects in sports videos. Computer Vision and Image Understanding, 159, 89-104. doi:10.1016/j.cviu.2016.12.003
NLM
Morimitsu H, Bloch I, César Júnior RM. Exploring structure for long-term tracking of multiple objects in sports videos [Internet]. Computer Vision and Image Understanding. 2017 ; 159 89-104.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.cviu.2016.12.003
Vancouver
Morimitsu H, Bloch I, César Júnior RM. Exploring structure for long-term tracking of multiple objects in sports videos [Internet]. Computer Vision and Image Understanding. 2017 ; 159 89-104.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.cviu.2016.12.003
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUIMARÃES, Felipe Pontes et al. Planning runtime software adaptation through pragmatic goal model. Data & Knowledge Engineering, v. 109, p. 25-40, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.datak.2017.03.003. Acesso em: 18 ago. 2024.
APA
Guimarães, F. P., Rodrigues, G. N., Ali, R., & Batista, D. M. (2017). Planning runtime software adaptation through pragmatic goal model. Data & Knowledge Engineering, 109, 25-40. doi:10.1016/j.datak.2017.03.003
NLM
Guimarães FP, Rodrigues GN, Ali R, Batista DM. Planning runtime software adaptation through pragmatic goal model [Internet]. Data & Knowledge Engineering. 2017 ; 109 25-40.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.datak.2017.03.003
Vancouver
Guimarães FP, Rodrigues GN, Ali R, Batista DM. Planning runtime software adaptation through pragmatic goal model [Internet]. Data & Knowledge Engineering. 2017 ; 109 25-40.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.datak.2017.03.003
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. On the semantics and complexity of probabilistic logic programs. Journal of Artificial Intelligence Research, v. 60, p. 221-262, 2017Tradução . . Disponível em: https://doi.org/10.1613/jair.5482. Acesso em: 18 ago. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2017). On the semantics and complexity of probabilistic logic programs. Journal of Artificial Intelligence Research, 60, 221-262. doi:10.1613/jair.5482
NLM
Cozman FG, Mauá DD. On the semantics and complexity of probabilistic logic programs [Internet]. Journal of Artificial Intelligence Research. 2017 ; 60 221-262.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1613/jair.5482
Vancouver
Cozman FG, Mauá DD. On the semantics and complexity of probabilistic logic programs [Internet]. Journal of Artificial Intelligence Research. 2017 ; 60 221-262.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1613/jair.5482
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi e CONATY, Diarmaid. Credal sum-product networks. PMLR: Proceedings of Machine Learning Research. Brookline: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: http://proceedings.mlr.press/v62/mau*C3*A117a.html. Acesso em: 18 ago. 2024. , 2017
APA
Mauá, D. D., Cozman, F. G., & Conaty, D. (2017). Credal sum-product networks. PMLR: Proceedings of Machine Learning Research. Brookline: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de http://proceedings.mlr.press/v62/mau*C3*A117a.html
NLM
Mauá DD, Cozman FG, Conaty D. Credal sum-product networks [Internet]. PMLR: Proceedings of Machine Learning Research. 2017 ;( 62): 205-216.[citado 2024 ago. 18 ] Available from: http://proceedings.mlr.press/v62/mau*C3*A117a.html
Vancouver
Mauá DD, Cozman FG, Conaty D. Credal sum-product networks [Internet]. PMLR: Proceedings of Machine Learning Research. 2017 ;( 62): 205-216.[citado 2024 ago. 18 ] Available from: http://proceedings.mlr.press/v62/mau*C3*A117a.html
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TAVARES, Anderson et al. A supervoxel-based solution to resume segmentation for interactive correction by differential image-foresting transforms. 2017, Anais.. Cham: Springer, 2017. Disponível em: https://doi.org/10.1007/978-3-319-57240-6_9. Acesso em: 18 ago. 2024.
APA
Tavares, A., Miranda, P. A. V. de, Spina, T. V., & Falcão, A. X. (2017). A supervoxel-based solution to resume segmentation for interactive correction by differential image-foresting transforms. In Mathematical Morphology and Its Applications to Signal and Image Processing: Proceedings. Cham: Springer. doi:10.1007%2F978-3-319-57240-6_9
NLM
Tavares A, Miranda PAV de, Spina TV, Falcão AX. A supervoxel-based solution to resume segmentation for interactive correction by differential image-foresting transforms [Internet]. Mathematical Morphology and Its Applications to Signal and Image Processing: Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.1007/978-3-319-57240-6_9
Vancouver
Tavares A, Miranda PAV de, Spina TV, Falcão AX. A supervoxel-based solution to resume segmentation for interactive correction by differential image-foresting transforms [Internet]. Mathematical Morphology and Its Applications to Signal and Image Processing: Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.1007/978-3-319-57240-6_9
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUEVARA, Jorge e HIRATA JÚNIOR, Roberto e CANU, Stéphane. Cross product kernels for fuzzy set similarity. 2017, Anais.. Piscataway: IEEE, 2017. Disponível em: https://doi.org/10.1109/FUZZ-IEEE.2017.8015459. Acesso em: 18 ago. 2024.
APA
Guevara, J., Hirata Júnior, R., & Canu, S. (2017). Cross product kernels for fuzzy set similarity. In Proceedings. Piscataway: IEEE. doi:10.1109/FUZZ-IEEE.2017.8015459
NLM
Guevara J, Hirata Júnior R, Canu S. Cross product kernels for fuzzy set similarity [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.1109/FUZZ-IEEE.2017.8015459
Vancouver
Guevara J, Hirata Júnior R, Canu S. Cross product kernels for fuzzy set similarity [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.1109/FUZZ-IEEE.2017.8015459
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIZUTANI, Wilson Kazuo e KON, Fábio. VORPAL: an extensible and flexible mddleware for real-time soundtracks in digital games. 2017, Anais.. Cham: Springer, 2017. Disponível em: https://doi.org/10.1007/978-3-319-67738-5_13. Acesso em: 18 ago. 2024.
APA
Mizutani, W. K., & Kon, F. (2017). VORPAL: an extensible and flexible mddleware for real-time soundtracks in digital games. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-67738-5_13
NLM
Mizutani WK, Kon F. VORPAL: an extensible and flexible mddleware for real-time soundtracks in digital games [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.1007/978-3-319-67738-5_13
Vancouver
Mizutani WK, Kon F. VORPAL: an extensible and flexible mddleware for real-time soundtracks in digital games [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.1007/978-3-319-67738-5_13
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ESPOSTE, Arthur de Moura del et al. InterSCity: a scalable microservice-based open source platform for smart cities. 2017, Anais.. Setúbal: SCITEPRESS, 2017. Disponível em: https://doi.org/10.5220/0006306200350046. Acesso em: 18 ago. 2024.
APA
Esposte, A. de M. del, Kon, F., Costa, F. M., & Lago, N. (2017). InterSCity: a scalable microservice-based open source platform for smart cities. In Proceedings. Setúbal: SCITEPRESS. doi:10.5220/0006306200350046
NLM
Esposte A de M del, Kon F, Costa FM, Lago N. InterSCity: a scalable microservice-based open source platform for smart cities [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.5220/0006306200350046
Vancouver
Esposte A de M del, Kon F, Costa FM, Lago N. InterSCity: a scalable microservice-based open source platform for smart cities [Internet]. Proceedings. 2017 ;[citado 2024 ago. 18 ] Available from: https://doi.org/10.5220/0006306200350046
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, v. 122, p. 508-542, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2016.07.010. Acesso em: 18 ago. 2024.
APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2017). Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, 122, 508-542. doi:10.1016/j.jctb.2016.07.010
NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122 508-542.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.jctb.2016.07.010
Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122 508-542.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.jctb.2016.07.010