Filtros : "IME" "Estados Unidos" "2018" Removido: "ESTATÍSTICA" Limpar

Filtros



Refine with date range


  • Unidade: IME

    Subjects: TEOREMAS LIMITES, PROBABILIDADE, TEORIA ASSINTÓTICA, CIÊNCIAS EXATAS (ESTATÍSTICAS E DADOS NUMÉRICOS), ESTATÍSTICAS DE SAÚDE, ESTATÍSTICAS DE SAÚDE

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SEN, Pranab Kumar e SINGER, Júlio da Motta. Large sample methods in statistics: an introduction with applications. . Boca Raton: CRC Press. Disponível em: https://doi.org/10.1201/9780203711606. Acesso em: 05 out. 2024. , 2018
    • APA

      Sen, P. K., & Singer, J. da M. (2018). Large sample methods in statistics: an introduction with applications. Boca Raton: CRC Press. doi:10.1201/9780203711606
    • NLM

      Sen PK, Singer J da M. Large sample methods in statistics: an introduction with applications [Internet]. 2018 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1201/9780203711606
    • Vancouver

      Sen PK, Singer J da M. Large sample methods in statistics: an introduction with applications [Internet]. 2018 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1201/9780203711606
  • Source: Empirical Software Engineering. Unidade: IME

    Assunto: SOFTWARE LIVRE

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PINTO, Gustavo et al. On the challenges of open-sourcing proprietary software projects. Empirical Software Engineering, v. 23, n. 6, p. 3221–3247, 2018Tradução . . Disponível em: https://doi.org/10.1007/s10664-018-9609-6. Acesso em: 05 out. 2024.
    • APA

      Pinto, G., Steinmacher, I., Dias, L. F., & Gerosa, M. A. (2018). On the challenges of open-sourcing proprietary software projects. Empirical Software Engineering, 23( 6), 3221–3247. doi:10.1007/s10664-018-9609-6
    • NLM

      Pinto G, Steinmacher I, Dias LF, Gerosa MA. On the challenges of open-sourcing proprietary software projects [Internet]. Empirical Software Engineering. 2018 ; 23( 6): 3221–3247.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/s10664-018-9609-6
    • Vancouver

      Pinto G, Steinmacher I, Dias LF, Gerosa MA. On the challenges of open-sourcing proprietary software projects [Internet]. Empirical Software Engineering. 2018 ; 23( 6): 3221–3247.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/s10664-018-9609-6
  • Source: Journal of Statistical Physics. Unidade: IME

    Subjects: PROCESSOS ESTOCÁSTICOS, PROCESSOS ALEATÓRIOS, BIOMATEMÁTICA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERRARI, Pablo Augusto et al. Phase transition for infinite systems of spiking neurons. Journal of Statistical Physics, v. 172, n. 6, p. 1564–1575, 2018Tradução . . Disponível em: https://doi.org/10.1007/s10955-018-2118-6. Acesso em: 05 out. 2024.
    • APA

      Ferrari, P. A., Galves, A., Grigorescu, I., & Löcherbach, E. (2018). Phase transition for infinite systems of spiking neurons. Journal of Statistical Physics, 172( 6), 1564–1575. doi:10.1007/s10955-018-2118-6
    • NLM

      Ferrari PA, Galves A, Grigorescu I, Löcherbach E. Phase transition for infinite systems of spiking neurons [Internet]. Journal of Statistical Physics. 2018 ; 172( 6): 1564–1575.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/s10955-018-2118-6
    • Vancouver

      Ferrari PA, Galves A, Grigorescu I, Löcherbach E. Phase transition for infinite systems of spiking neurons [Internet]. Journal of Statistical Physics. 2018 ; 172( 6): 1564–1575.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/s10955-018-2118-6
  • Source: Algorithmica. Unidade: IME

    Subjects: CIÊNCIA DA COMPUTAÇÃO, CONFIABILIDADE DE SOFTWARE, ARQUITETURA ORIENTADA A SERVIÇOS, ALGORITMOS DE APROXIMAÇÃO

    Versão AceitaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERNANDES, Cristina Gomes e PAULA, Samuel P. de e PEDROSA, Lehilton L. C. Improved approximation algorithms for capacitated fault-tolerant k-Center. Algorithmica, v. 80, n. 3, p. 1041–1072, 2018Tradução . . Disponível em: https://doi.org/10.1007/s00453-017-0398-x. Acesso em: 05 out. 2024.
    • APA

      Fernandes, C. G., Paula, S. P. de, & Pedrosa, L. L. C. (2018). Improved approximation algorithms for capacitated fault-tolerant k-Center. Algorithmica, 80( 3), 1041–1072. doi:10.1007/s00453-017-0398-x
    • NLM

      Fernandes CG, Paula SP de, Pedrosa LLC. Improved approximation algorithms for capacitated fault-tolerant k-Center [Internet]. Algorithmica. 2018 ; 80( 3): 1041–1072.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/s00453-017-0398-x
    • Vancouver

      Fernandes CG, Paula SP de, Pedrosa LLC. Improved approximation algorithms for capacitated fault-tolerant k-Center [Internet]. Algorithmica. 2018 ; 80( 3): 1041–1072.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/s00453-017-0398-x
  • Source: Experimental Mathematics. Unidade: IME

    Subjects: PROGRAMAÇÃO MATEMÁTICA, MATEMÁTICA DISCRETA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CALUZA MACHADO, Fabrício e OLIVEIRA FILHO, Fernando Mário de. Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry. Experimental Mathematics, v. 27, n. 3, p. 362-369, 2018Tradução . . Disponível em: https://doi.org/10.1080/10586458.2017.1286273. Acesso em: 05 out. 2024.
    • APA

      Caluza Machado, F., & Oliveira Filho, F. M. de. (2018). Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry. Experimental Mathematics, 27( 3), 362-369. doi:10.1080/10586458.2017.1286273
    • NLM

      Caluza Machado F, Oliveira Filho FM de. Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry [Internet]. Experimental Mathematics. 2018 ; 27( 3): 362-369.[citado 2024 out. 05 ] Available from: https://doi.org/10.1080/10586458.2017.1286273
    • Vancouver

      Caluza Machado F, Oliveira Filho FM de. Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry [Internet]. Experimental Mathematics. 2018 ; 27( 3): 362-369.[citado 2024 out. 05 ] Available from: https://doi.org/10.1080/10586458.2017.1286273
  • Source: Journal of Algebra. Unidade: IME

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ANDRUSKIEWITSCH, Nicolás et al. Special issue in honor of Efim Zelmanov. [Introdução]. Journal of Algebra. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.jalgebra.2018.01.012. Acesso em: 05 out. 2024. , 2018
    • APA

      Andruskiewitsch, N., Elduque, A., Khukhro, E. I., & Shestakov, I. P. (2018). Special issue in honor of Efim Zelmanov. [Introdução]. Journal of Algebra. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.jalgebra.2018.01.012
    • NLM

      Andruskiewitsch N, Elduque A, Khukhro EI, Shestakov IP. Special issue in honor of Efim Zelmanov. [Introdução] [Internet]. Journal of Algebra. 2018 ; 500 1-2.[citado 2024 out. 05 ] Available from: https://doi.org/10.1016/j.jalgebra.2018.01.012
    • Vancouver

      Andruskiewitsch N, Elduque A, Khukhro EI, Shestakov IP. Special issue in honor of Efim Zelmanov. [Introdução] [Internet]. Journal of Algebra. 2018 ; 500 1-2.[citado 2024 out. 05 ] Available from: https://doi.org/10.1016/j.jalgebra.2018.01.012
  • Source: Proceedings. Conference titles: Brazilian Conference on Intelligent Systems (BRACIS). Unidade: IME

    Subjects: SISTEMAS BASEADOS EM CONHECIMENTO, SEMÂNTICA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERMÉ, Eduardo e WASSERMANN, Renata. Iterated belief change the case of expansion into inconsistency. 2018, Anais.. Piscataway: IEEE, 2018. Disponível em: https://doi.org/10.1109/BRACIS.2017.35. Acesso em: 05 out. 2024.
    • APA

      Fermé, E., & Wassermann, R. (2018). Iterated belief change the case of expansion into inconsistency. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2017.35
    • NLM

      Fermé E, Wassermann R. Iterated belief change the case of expansion into inconsistency [Internet]. Proceedings. 2018 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1109/BRACIS.2017.35
    • Vancouver

      Fermé E, Wassermann R. Iterated belief change the case of expansion into inconsistency [Internet]. Proceedings. 2018 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1109/BRACIS.2017.35
  • Source: Communications in Algebra. Unidade: IME

    Assunto: ÁLGEBRAS DE LIE

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BILLIG, Yuly e FUTORNY, Vyacheslav. Lie algebras of vector fields on smooth affine varieties. Communications in Algebra, v. 46, n. 8, p. 3413–3429, 2018Tradução . . Disponível em: https://doi.org/10.1080/00927872.2017.1412456. Acesso em: 05 out. 2024.
    • APA

      Billig, Y., & Futorny, V. (2018). Lie algebras of vector fields on smooth affine varieties. Communications in Algebra, 46( 8), 3413–3429. doi:10.1080/00927872.2017.1412456
    • NLM

      Billig Y, Futorny V. Lie algebras of vector fields on smooth affine varieties [Internet]. Communications in Algebra. 2018 ; 46( 8): 3413–3429.[citado 2024 out. 05 ] Available from: https://doi.org/10.1080/00927872.2017.1412456
    • Vancouver

      Billig Y, Futorny V. Lie algebras of vector fields on smooth affine varieties [Internet]. Communications in Algebra. 2018 ; 46( 8): 3413–3429.[citado 2024 out. 05 ] Available from: https://doi.org/10.1080/00927872.2017.1412456
  • Source: Journal of Graph Theory. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERNANDES, Cristina Gomes e SCHMIDT, Tina Janne e TARAZ, Anusch. On minimum bisection and related cut problems in trees and tree-like graphs. Journal of Graph Theory, v. 89, n. 2, p. 214-245, 2018Tradução . . Disponível em: https://doi.org/10.1002/jgt.22248. Acesso em: 05 out. 2024.
    • APA

      Fernandes, C. G., Schmidt, T. J., & Taraz, A. (2018). On minimum bisection and related cut problems in trees and tree-like graphs. Journal of Graph Theory, 89( 2), 214-245. doi:10.1002/jgt.22248
    • NLM

      Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related cut problems in trees and tree-like graphs [Internet]. Journal of Graph Theory. 2018 ; 89( 2): 214-245.[citado 2024 out. 05 ] Available from: https://doi.org/10.1002/jgt.22248
    • Vancouver

      Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related cut problems in trees and tree-like graphs [Internet]. Journal of Graph Theory. 2018 ; 89( 2): 214-245.[citado 2024 out. 05 ] Available from: https://doi.org/10.1002/jgt.22248
  • Source: Journal of Mathematical Analysis and Applications. Unidade: IME

    Subjects: EQUAÇÕES DIFERENCIAIS PARCIAIS ELÍTICAS DE 2ª ORDEM, EQUAÇÕES DIFERENCIAIS PARCIAIS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LOPES, Pedro Tavares Paes e PEREIRA, Marcone Corrêa. Dynamical boundary conditions in a non-cylindrical domain for the Laplace equation. Journal of Mathematical Analysis and Applications, v. 465, n. 1, p. 379-402, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.jmaa.2018.05.015. Acesso em: 05 out. 2024.
    • APA

      Lopes, P. T. P., & Pereira, M. C. (2018). Dynamical boundary conditions in a non-cylindrical domain for the Laplace equation. Journal of Mathematical Analysis and Applications, 465( 1), 379-402. doi:10.1016/j.jmaa.2018.05.015
    • NLM

      Lopes PTP, Pereira MC. Dynamical boundary conditions in a non-cylindrical domain for the Laplace equation [Internet]. Journal of Mathematical Analysis and Applications. 2018 ; 465( 1): 379-402.[citado 2024 out. 05 ] Available from: https://doi.org/10.1016/j.jmaa.2018.05.015
    • Vancouver

      Lopes PTP, Pereira MC. Dynamical boundary conditions in a non-cylindrical domain for the Laplace equation [Internet]. Journal of Mathematical Analysis and Applications. 2018 ; 465( 1): 379-402.[citado 2024 out. 05 ] Available from: https://doi.org/10.1016/j.jmaa.2018.05.015
  • Source: Communications in Statistics - Simulation and Computation. Unidades: ESALQ, IME

    Subjects: REGRESSÃO LINEAR, ANÁLISE DE SOBREVIVÊNCIA, DADOS CENSURADOS, MÉTODO DE CAUCHY, MÉTODOS DE DIAGNÓSTICOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      RAMIRES, Thiago Gentil et al. New regression model with four regression structures and computational aspects. Communications in Statistics - Simulation and Computation, v. 47, n. 7, p. 1940-1962, 2018Tradução . . Disponível em: https://doi.org/10.1080/03610918.2017.1332212. Acesso em: 05 out. 2024.
    • APA

      Ramires, T. G., Ortega, E. M. M., Cordeiro, G. M., Paula, G. A., & Hens, N. (2018). New regression model with four regression structures and computational aspects. Communications in Statistics - Simulation and Computation, 47( 7), 1940-1962. doi:10.1080/03610918.2017.1332212
    • NLM

      Ramires TG, Ortega EMM, Cordeiro GM, Paula GA, Hens N. New regression model with four regression structures and computational aspects [Internet]. Communications in Statistics - Simulation and Computation. 2018 ; 47( 7): 1940-1962.[citado 2024 out. 05 ] Available from: https://doi.org/10.1080/03610918.2017.1332212
    • Vancouver

      Ramires TG, Ortega EMM, Cordeiro GM, Paula GA, Hens N. New regression model with four regression structures and computational aspects [Internet]. Communications in Statistics - Simulation and Computation. 2018 ; 47( 7): 1940-1962.[citado 2024 out. 05 ] Available from: https://doi.org/10.1080/03610918.2017.1332212
  • Source: Applied Mathematics & Optimization. Unidade: IME

    Assunto: VARIEDADES RIEMANNIANAS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BORTOT, C. A et al. Exponential asymptotic stability for the Klein Gordon equation on non-compact riemannian manifolds. Applied Mathematics & Optimization, v. 78, n. 2, p. 219–265, 2018Tradução . . Disponível em: https://doi.org/10.1007/s00245-017-9405-5. Acesso em: 05 out. 2024.
    • APA

      Bortot, C. A., Cavalcanti, M. M., Domingos Cavalcanti, V. N., & Piccione, P. (2018). Exponential asymptotic stability for the Klein Gordon equation on non-compact riemannian manifolds. Applied Mathematics & Optimization, 78( 2), 219–265. doi:10.1007/s00245-017-9405-5
    • NLM

      Bortot CA, Cavalcanti MM, Domingos Cavalcanti VN, Piccione P. Exponential asymptotic stability for the Klein Gordon equation on non-compact riemannian manifolds [Internet]. Applied Mathematics & Optimization. 2018 ; 78( 2): 219–265.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/s00245-017-9405-5
    • Vancouver

      Bortot CA, Cavalcanti MM, Domingos Cavalcanti VN, Piccione P. Exponential asymptotic stability for the Klein Gordon equation on non-compact riemannian manifolds [Internet]. Applied Mathematics & Optimization. 2018 ; 78( 2): 219–265.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/s00245-017-9405-5
  • Source: Journal of Algebra. Unidade: IME

    Subjects: GRUPOS QUÂNTICOS, ANÉIS E ÁLGEBRAS NÃO ASSOCIATIVOS, ÁLGEBRAS DE LIE, SUPERÁLGEBRAS DE LIE

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FUTORNY, Vyacheslav e RAMÍREZ, Luis Enrique e ZHANG, Jian. Gelfand–Tsetlin modules of quantum gln defined by admissible sets of relations. Journal of Algebra, v. 499, p. 375-396, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.jalgebra.2017.12.006. Acesso em: 05 out. 2024.
    • APA

      Futorny, V., Ramírez, L. E., & Zhang, J. (2018). Gelfand–Tsetlin modules of quantum gln defined by admissible sets of relations. Journal of Algebra, 499, 375-396. doi:10.1016/j.jalgebra.2017.12.006
    • NLM

      Futorny V, Ramírez LE, Zhang J. Gelfand–Tsetlin modules of quantum gln defined by admissible sets of relations [Internet]. Journal of Algebra. 2018 ; 499 375-396.[citado 2024 out. 05 ] Available from: https://doi.org/10.1016/j.jalgebra.2017.12.006
    • Vancouver

      Futorny V, Ramírez LE, Zhang J. Gelfand–Tsetlin modules of quantum gln defined by admissible sets of relations [Internet]. Journal of Algebra. 2018 ; 499 375-396.[citado 2024 out. 05 ] Available from: https://doi.org/10.1016/j.jalgebra.2017.12.006
  • Source: IEEE Transactions on Information Theory. Unidade: IME

    Subjects: PROCESSOS ESTOCÁSTICOS, ENTROPIA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ABADI, Miguel Natalio e GALLO, Sandro e RADA MORA, Erika Alejandra. The shortest possible return time of β-mixing processes. IEEE Transactions on Information Theory, v. 64, n. 7, p. 4895-4906, 2018Tradução . . Disponível em: https://doi.org/10.1109/TIT.2017.2757494. Acesso em: 05 out. 2024.
    • APA

      Abadi, M. N., Gallo, S., & Rada Mora, E. A. (2018). The shortest possible return time of β-mixing processes. IEEE Transactions on Information Theory, 64( 7), 4895-4906. doi:10.1109/TIT.2017.2757494
    • NLM

      Abadi MN, Gallo S, Rada Mora EA. The shortest possible return time of β-mixing processes [Internet]. IEEE Transactions on Information Theory. 2018 ; 64( 7): 4895-4906.[citado 2024 out. 05 ] Available from: https://doi.org/10.1109/TIT.2017.2757494
    • Vancouver

      Abadi MN, Gallo S, Rada Mora EA. The shortest possible return time of β-mixing processes [Internet]. IEEE Transactions on Information Theory. 2018 ; 64( 7): 4895-4906.[citado 2024 out. 05 ] Available from: https://doi.org/10.1109/TIT.2017.2757494
  • Source: Proceedings. Conference titles: International Conference on Bioinformatics and Biomedical Technology - ICBBT. Unidade: IME

    Subjects: BIOINFORMÁTICA, COMPUTAÇÃO APLICADA, NEOPLASIAS MAMÁRIAS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MATTIOLI, Diogo e GUBITOSO, Marco Dimas. Application of graph database in the storage of heterogeneous Omics data for the treatment in bioinformatics. 2018, Anais.. New York: ACM, 2018. Disponível em: https://doi.org/10.1145/3232059.3232068. Acesso em: 05 out. 2024.
    • APA

      Mattioli, D., & Gubitoso, M. D. (2018). Application of graph database in the storage of heterogeneous Omics data for the treatment in bioinformatics. In Proceedings. New York: ACM. doi:10.1145/3232059.3232068
    • NLM

      Mattioli D, Gubitoso MD. Application of graph database in the storage of heterogeneous Omics data for the treatment in bioinformatics [Internet]. Proceedings. 2018 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1145/3232059.3232068
    • Vancouver

      Mattioli D, Gubitoso MD. Application of graph database in the storage of heterogeneous Omics data for the treatment in bioinformatics [Internet]. Proceedings. 2018 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1145/3232059.3232068
  • Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming - ISMP. Unidade: IME

    Assunto: OTIMIZAÇÃO MATEMÁTICA

    Versão PublicadaAcesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      HAESER, Gabriel. An extension of Yuan’s Lemma and its applications in optimization. 2018, Anais.. Philadelphia: Mathematical Optimization Society, 2018. Disponível em: https://ismp2018.sciencesconf.org/data/bookFullProgram.pdf. Acesso em: 05 out. 2024.
    • APA

      Haeser, G. (2018). An extension of Yuan’s Lemma and its applications in optimization. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de https://ismp2018.sciencesconf.org/data/bookFullProgram.pdf
    • NLM

      Haeser G. An extension of Yuan’s Lemma and its applications in optimization [Internet]. Book of abstracts. 2018 ;[citado 2024 out. 05 ] Available from: https://ismp2018.sciencesconf.org/data/bookFullProgram.pdf
    • Vancouver

      Haeser G. An extension of Yuan’s Lemma and its applications in optimization [Internet]. Book of abstracts. 2018 ;[citado 2024 out. 05 ] Available from: https://ismp2018.sciencesconf.org/data/bookFullProgram.pdf
  • Source: Proceedings. Conference titles: ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection - META. Unidade: IME

    Subjects: ENGENHARIA DE PROGRAMAS, METADADOS, CODIFICAÇÃO DE PROGRAMA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      TEIXEIRA, Rodrigo et al. Does it make sense to have application-specific code conventions as a complementary approach to code annotations? 2018, Anais.. New York: ACM, 2018. Disponível em: https://doi.org/10.1145/3281074.3281078. Acesso em: 05 out. 2024.
    • APA

      Teixeira, R., Guerra, E., Lima, P., Meirelles, P., & Kon, F. (2018). Does it make sense to have application-specific code conventions as a complementary approach to code annotations? In Proceedings. New York: ACM. doi:10.1145/3281074.3281078
    • NLM

      Teixeira R, Guerra E, Lima P, Meirelles P, Kon F. Does it make sense to have application-specific code conventions as a complementary approach to code annotations? [Internet]. Proceedings. 2018 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1145/3281074.3281078
    • Vancouver

      Teixeira R, Guerra E, Lima P, Meirelles P, Kon F. Does it make sense to have application-specific code conventions as a complementary approach to code annotations? [Internet]. Proceedings. 2018 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1145/3281074.3281078
  • Source: Proceedings. Conference titles: Frontiers in Education Conference -FIE. Unidades: IME, EP

    Subjects: GEOMETRIA E MODELAGEM COMPUTACIONAL, INTERAÇÃO HOMEM-MÁQUINA, CONHECIMENTO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LUQUE, Leandro e BRANDÃO, Leonidas de Oliveira e BRANDÃO, Anarosa Alves Franco. A framework to foster diversity in collaborative activities. 2018, Anais.. Piscataway: IEEE, 2018. Disponível em: https://doi.org/10.1109/FIE.2018.8658438. Acesso em: 05 out. 2024.
    • APA

      Luque, L., Brandão, L. de O., & Brandão, A. A. F. (2018). A framework to foster diversity in collaborative activities. In Proceedings. Piscataway: IEEE. doi:10.1109/FIE.2018.8658438
    • NLM

      Luque L, Brandão L de O, Brandão AAF. A framework to foster diversity in collaborative activities [Internet]. Proceedings. 2018 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1109/FIE.2018.8658438
    • Vancouver

      Luque L, Brandão L de O, Brandão AAF. A framework to foster diversity in collaborative activities [Internet]. Proceedings. 2018 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1109/FIE.2018.8658438
  • Source: International Journal of Approximate Reasoning. Unidades: EACH, IME

    Subjects: ONTOLOGIAS, LÓGICA, REVISÃO DE CRENÇAS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SANTOS, Yuri David et al. Partial meet pseudo-contractions. International Journal of Approximate Reasoning, v. 103, p. 11-27, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2018.08.006. Acesso em: 05 out. 2024.
    • APA

      Santos, Y. D., Matos, V. B., Ribeiro, M. M., & Wassermann, R. (2018). Partial meet pseudo-contractions. International Journal of Approximate Reasoning, 103, 11-27. doi:10.1016/j.ijar.2018.08.006
    • NLM

      Santos YD, Matos VB, Ribeiro MM, Wassermann R. Partial meet pseudo-contractions [Internet]. International Journal of Approximate Reasoning. 2018 ; 103 11-27.[citado 2024 out. 05 ] Available from: https://doi.org/10.1016/j.ijar.2018.08.006
    • Vancouver

      Santos YD, Matos VB, Ribeiro MM, Wassermann R. Partial meet pseudo-contractions [Internet]. International Journal of Approximate Reasoning. 2018 ; 103 11-27.[citado 2024 out. 05 ] Available from: https://doi.org/10.1016/j.ijar.2018.08.006
  • Source: International Journal of Wireless Networks and Broadband Technologies. Unidade: IME

    Subjects: PROTOCOLOS DE COMUNICAÇÃO, PROCESSAMENTO DE SINAIS

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MOTA, Rafael Perazzo Barbosa e BATISTA, Daniel Macêdo. An RFID best effort mechanism for in motion tracking applications. International Journal of Wireless Networks and Broadband Technologies, v. 7, n. 1, p. 1-14, 2018Tradução . . Disponível em: https://doi.org/10.4018/IJWNBT.2018010104. Acesso em: 05 out. 2024.
    • APA

      Mota, R. P. B., & Batista, D. M. (2018). An RFID best effort mechanism for in motion tracking applications. International Journal of Wireless Networks and Broadband Technologies, 7( 1), 1-14. doi:10.4018/IJWNBT.2018010104
    • NLM

      Mota RPB, Batista DM. An RFID best effort mechanism for in motion tracking applications [Internet]. International Journal of Wireless Networks and Broadband Technologies. 2018 ; 7( 1): 1-14.[citado 2024 out. 05 ] Available from: https://doi.org/10.4018/IJWNBT.2018010104
    • Vancouver

      Mota RPB, Batista DM. An RFID best effort mechanism for in motion tracking applications [Internet]. International Journal of Wireless Networks and Broadband Technologies. 2018 ; 7( 1): 1-14.[citado 2024 out. 05 ] Available from: https://doi.org/10.4018/IJWNBT.2018010104

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