Filtros : "Indexado na Web of Science" "2019" "IME" Removidos: "Universidad Nacional Autónoma de México (UNAM)" "COELHO, FLAVIO ULHOA" "Índia" Limpar

Filtros



Refine with date range


  • Source: Future Generation Computer Systems. Unidades: IME, EACH

    Subjects: CIDADES INTELIGENTES, INOVAÇÕES TECNOLÓGICAS, MIDDLEWARE

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

      DEL ESPOSTE, Arthur de Moura et al. Design and evaluation of a scalable smart city software platform with large-scale simulations. Future Generation Computer Systems, v. 93, p. 427-441, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.future.2018.10.026. Acesso em: 13 out. 2024.
    • APA

      Del Esposte, A. de M., Santana, E. F. Z., Kanashiro, L., Costa, F. M., Braghetto, K. R., Lago, N., & Kon, F. (2019). Design and evaluation of a scalable smart city software platform with large-scale simulations. Future Generation Computer Systems, 93, 427-441. doi:10.1016/j.future.2018.10.026
    • NLM

      Del Esposte A de M, Santana EFZ, Kanashiro L, Costa FM, Braghetto KR, Lago N, Kon F. Design and evaluation of a scalable smart city software platform with large-scale simulations [Internet]. Future Generation Computer Systems. 2019 ; 93 427-441.[citado 2024 out. 13 ] Available from: https://doi.org/10.1016/j.future.2018.10.026
    • Vancouver

      Del Esposte A de M, Santana EFZ, Kanashiro L, Costa FM, Braghetto KR, Lago N, Kon F. Design and evaluation of a scalable smart city software platform with large-scale simulations [Internet]. Future Generation Computer Systems. 2019 ; 93 427-441.[citado 2024 out. 13 ] Available from: https://doi.org/10.1016/j.future.2018.10.026
  • Source: Communications in Statistics - Theory and Methods. Unidade: IME

    Subjects: DISTRIBUIÇÕES (PROBABILIDADE), DISTRIBUIÇÃO ELÍPTICA

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

      REYES, Jimmy et al. A new class of slash-elliptical distributions. Communications in Statistics - Theory and Methods, v. 48, n. 12, p. 3105–3121, 2019Tradução . . Disponível em: https://doi.org/10.1080/03610926.2018.1473607. Acesso em: 13 out. 2024.
    • APA

      Reyes, J., Gallardo, D. I., Bolfarine, H., & Gómez, H. W. (2019). A new class of slash-elliptical distributions. Communications in Statistics - Theory and Methods, 48( 12), 3105–3121. doi:10.1080/03610926.2018.1473607
    • NLM

      Reyes J, Gallardo DI, Bolfarine H, Gómez HW. A new class of slash-elliptical distributions [Internet]. Communications in Statistics - Theory and Methods. 2019 ; 48( 12): 3105–3121.[citado 2024 out. 13 ] Available from: https://doi.org/10.1080/03610926.2018.1473607
    • Vancouver

      Reyes J, Gallardo DI, Bolfarine H, Gómez HW. A new class of slash-elliptical distributions [Internet]. Communications in Statistics - Theory and Methods. 2019 ; 48( 12): 3105–3121.[citado 2024 out. 13 ] Available from: https://doi.org/10.1080/03610926.2018.1473607
  • Source: Mathematische Nachrichten. Unidade: IME

    Assunto: ESPAÇOS DE BANACH

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

      CORTES, Vinícius Morelli e GALEGO, Elói Medina e SAMUEL, Christian. When is c0(τ) complemented in tensor products of ℓp(I)?. Mathematische Nachrichten, v. 292, n. 5, p. 1089-1105, 2019Tradução . . Disponível em: https://doi.org/10.1002/mana.201700348. Acesso em: 13 out. 2024.
    • APA

      Cortes, V. M., Galego, E. M., & Samuel, C. (2019). When is c0(τ) complemented in tensor products of ℓp(I)? Mathematische Nachrichten, 292( 5), 1089-1105. doi:10.1002/mana.201700348
    • NLM

      Cortes VM, Galego EM, Samuel C. When is c0(τ) complemented in tensor products of ℓp(I)? [Internet]. Mathematische Nachrichten. 2019 ; 292( 5): 1089-1105.[citado 2024 out. 13 ] Available from: https://doi.org/10.1002/mana.201700348
    • Vancouver

      Cortes VM, Galego EM, Samuel C. When is c0(τ) complemented in tensor products of ℓp(I)? [Internet]. Mathematische Nachrichten. 2019 ; 292( 5): 1089-1105.[citado 2024 out. 13 ] Available from: https://doi.org/10.1002/mana.201700348
  • Source: Microorganisms. Unidades: FM, IFSC, IME

    Subjects: ESCHERICHIA COLI, EXPRESSÃO GÊNICA

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

      BANDO, Sílvia Yumi et al. Dynamic gene network analysis of caco-2 cell response to shiga toxin-producing Escherichia coli-associated hemolytic-uremic syndrome. Microorganisms, v. 7, n. 7, p. 195-1-195-23, 2019Tradução . . Disponível em: https://doi.org/10.3390/microorganisms7070195. Acesso em: 13 out. 2024.
    • APA

      Bando, S. Y., Iamashita, P., Silva, F. N., Costa, L. da F., Abe, C. M., Bertonha, F. B., et al. (2019). Dynamic gene network analysis of caco-2 cell response to shiga toxin-producing Escherichia coli-associated hemolytic-uremic syndrome. Microorganisms, 7( 7), 195-1-195-23. doi:10.3390/microorganisms7070195
    • NLM

      Bando SY, Iamashita P, Silva FN, Costa L da F, Abe CM, Bertonha FB, Guth BEC, Fujita A, Moreira-Filho CA. Dynamic gene network analysis of caco-2 cell response to shiga toxin-producing Escherichia coli-associated hemolytic-uremic syndrome [Internet]. Microorganisms. 2019 ; 7( 7): 195-1-195-23.[citado 2024 out. 13 ] Available from: https://doi.org/10.3390/microorganisms7070195
    • Vancouver

      Bando SY, Iamashita P, Silva FN, Costa L da F, Abe CM, Bertonha FB, Guth BEC, Fujita A, Moreira-Filho CA. Dynamic gene network analysis of caco-2 cell response to shiga toxin-producing Escherichia coli-associated hemolytic-uremic syndrome [Internet]. Microorganisms. 2019 ; 7( 7): 195-1-195-23.[citado 2024 out. 13 ] Available from: https://doi.org/10.3390/microorganisms7070195
  • Source: European Journal of Operational Research. Unidade: IME

    Subjects: PROGRAMAÇÃO NÃO LINEAR, ALGORITMOS PARA PROCESSAMENTO

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

      BIRGIN, Ernesto Julian Goldberg e LOBATO, Rafael Durbano. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, v. 272, n. 2, p. 447-464, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2018.07.006. Acesso em: 13 out. 2024.
    • APA

      Birgin, E. J. G., & Lobato, R. D. (2019). A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, 272( 2), 447-464. doi:10.1016/j.ejor.2018.07.006
    • NLM

      Birgin EJG, Lobato RD. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids [Internet]. European Journal of Operational Research. 2019 ; 272( 2): 447-464.[citado 2024 out. 13 ] Available from: https://doi.org/10.1016/j.ejor.2018.07.006
    • Vancouver

      Birgin EJG, Lobato RD. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids [Internet]. European Journal of Operational Research. 2019 ; 272( 2): 447-464.[citado 2024 out. 13 ] Available from: https://doi.org/10.1016/j.ejor.2018.07.006
  • Source: Mathematical Programming. Unidade: IME

    Subjects: PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO NÃO LINEAR

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

      HAESER, Gabriel e LIU, Hongcheng e YE, Yinyu. Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Mathematical Programming, v. 178, n. 1-2, p. 263-299, 2019Tradução . . Disponível em: https://doi.org/10.1007/s10107-018-1290-4. Acesso em: 13 out. 2024.
    • APA

      Haeser, G., Liu, H., & Ye, Y. (2019). Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Mathematical Programming, 178( 1-2), 263-299. doi:10.1007/s10107-018-1290-4
    • NLM

      Haeser G, Liu H, Ye Y. Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary [Internet]. Mathematical Programming. 2019 ; 178( 1-2): 263-299.[citado 2024 out. 13 ] Available from: https://doi.org/10.1007/s10107-018-1290-4
    • Vancouver

      Haeser G, Liu H, Ye Y. Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary [Internet]. Mathematical Programming. 2019 ; 178( 1-2): 263-299.[citado 2024 out. 13 ] Available from: https://doi.org/10.1007/s10107-018-1290-4
  • Source: Mathematical Proceedings of the Cambridge Philosophical Society. Unidade: IME

    Subjects: GRAFOS ALEATÓRIOS, COMBINATÓRIA PROBABILÍSTICA

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

      KOHAYAKAWA, Yoshiharu e MOTA, Guilherme Oliveira e SCHACHT, Mathias. Monochromatic trees in random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, v. 166, n. 1, p. 191-208, 2019Tradução . . Disponível em: https://doi.org/10.1017/S0305004117000846. Acesso em: 13 out. 2024.
    • APA

      Kohayakawa, Y., Mota, G. O., & Schacht, M. (2019). Monochromatic trees in random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 166( 1), 191-208. doi:10.1017/S0305004117000846
    • NLM

      Kohayakawa Y, Mota GO, Schacht M. Monochromatic trees in random graphs [Internet]. Mathematical Proceedings of the Cambridge Philosophical Society. 2019 ; 166( 1): 191-208.[citado 2024 out. 13 ] Available from: https://doi.org/10.1017/S0305004117000846
    • Vancouver

      Kohayakawa Y, Mota GO, Schacht M. Monochromatic trees in random graphs [Internet]. Mathematical Proceedings of the Cambridge Philosophical Society. 2019 ; 166( 1): 191-208.[citado 2024 out. 13 ] Available from: https://doi.org/10.1017/S0305004117000846
  • Source: Neuroinformatics. Unidades: IME, IFSC

    Subjects: COMPUTAÇÃO APLICADA, BIOINFORMÁTICA, VISÃO COMPUTACIONAL

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

      CERVANTES, Evelyn Perez et al. Morphological neuron classification based on dendritic tree hierarchy. Neuroinformatics, v. 17, n. Ja 2019, p. 147-161, 2019Tradução . . Disponível em: https://doi.org/10.1007/s12021-018-9388-7. Acesso em: 13 out. 2024.
    • APA

      Cervantes, E. P., Comin, C. H., César Júnior, R. M., & Costa, L. da F. (2019). Morphological neuron classification based on dendritic tree hierarchy. Neuroinformatics, 17( Ja 2019), 147-161. doi:10.1007/s12021-018-9388-7
    • NLM

      Cervantes EP, Comin CH, César Júnior RM, Costa L da F. Morphological neuron classification based on dendritic tree hierarchy [Internet]. Neuroinformatics. 2019 ; 17( Ja 2019): 147-161.[citado 2024 out. 13 ] Available from: https://doi.org/10.1007/s12021-018-9388-7
    • Vancouver

      Cervantes EP, Comin CH, César Júnior RM, Costa L da F. Morphological neuron classification based on dendritic tree hierarchy [Internet]. Neuroinformatics. 2019 ; 17( Ja 2019): 147-161.[citado 2024 out. 13 ] Available from: https://doi.org/10.1007/s12021-018-9388-7

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