Menu

Filtros : "IME-MAC" "Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)" Removidos: "HUSSEIN, MAHIR SALEH" "MARIN NETO, JOSE ANTONIO" "sg" Limpar

Filtros

Refine with date range

1 - 20 (604 records)

  • Artigo de periodico

    On the complexity of solving feasibility problems with regularized models (2022)

    Birgin, Ernesto Julian Goldberg ; Bueno, Luís Felipe ; Martínez, José Mário

    Source: Optimization Methods and Software. Unidade: IME

    Subjects: PROGRAMAÇÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA MÉTODOS

    Versão PublicadaAcesso à 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 BUENO, Luís Felipe e MARTÍNEZ, José Mário. On the complexity of solving feasibility problems with regularized models. Optimization Methods and Software, v. 37, n. 2, p. 405-424, 2022Tradução . . Disponível em: https://doi.org/10.1080/10556788.2020.1786564. Acesso em: 28 jun. 2024.

    • APA

      Birgin, E. J. G., Bueno, L. F., & Martínez, J. M. (2022). On the complexity of solving feasibility problems with regularized models. Optimization Methods and Software, 37( 2), 405-424. doi:10.1080/10556788.2020.1786564

    • NLM

      Birgin EJG, Bueno LF, Martínez JM. On the complexity of solving feasibility problems with regularized models [Internet]. Optimization Methods and Software. 2022 ; 37( 2): 405-424.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1080/10556788.2020.1786564

    • Vancouver

      Birgin EJG, Bueno LF, Martínez JM. On the complexity of solving feasibility problems with regularized models [Internet]. Optimization Methods and Software. 2022 ; 37( 2): 405-424.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1080/10556788.2020.1786564

  • Trabalho de evento

    Approximation and parameterized algorithms for balanced connected partition problems (2022)

    Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko

    Source: Proceedings. Conference titles: Conference on Algorithms and Discrete Applied Mathematics - CALDAM. Unidade: IME

    Assunto: ALGORITMOS DE APROXIMAÇÃO

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

    • ABNT

      MOURA, Phablo Fernando Soares e OTA, Matheus Jun e WAKABAYASHI, Yoshiko. Approximation and parameterized algorithms for balanced connected partition problems. 2022, Anais.. Cham: Springer, 2022. Disponível em: https://doi.org/10.1007/978-3-030-95018-7_17. Acesso em: 28 jun. 2024.

    • APA

      Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2022). Approximation and parameterized algorithms for balanced connected partition problems. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-95018-7_17

    • NLM

      Moura PFS, Ota MJ, Wakabayashi Y. Approximation and parameterized algorithms for balanced connected partition problems [Internet]. Proceedings. 2022 ;[citado 2024 jun. 28 ] Available from: https://doi.org/10.1007/978-3-030-95018-7_17

    • Vancouver

      Moura PFS, Ota MJ, Wakabayashi Y. Approximation and parameterized algorithms for balanced connected partition problems [Internet]. Proceedings. 2022 ;[citado 2024 jun. 28 ] Available from: https://doi.org/10.1007/978-3-030-95018-7_17

  • Artigo de periodico

    Robust and reliable process-aware information systems (2021)

    Schwerz, Andre Luis; Liberato, Rafael; Pu, Calton; Ferreira, João Eduardo

    Source: IEEE Transactions on Services Computing. Unidade: IME

    Subjects: SISTEMAS DE INFORMAÇÃO, BANCO DE DADOS

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

    • ABNT

      SCHWERZ, Andre Luis et al. Robust and reliable process-aware information systems. IEEE Transactions on Services Computing, v. 14. n. 3, p. 820-833, 2021Tradução . . Disponível em: https://doi.org/10.1109/TSC.2018.2824810. Acesso em: 28 jun. 2024.

    • APA

      Schwerz, A. L., Liberato, R., Pu, C., & Ferreira, J. E. (2021). Robust and reliable process-aware information systems. IEEE Transactions on Services Computing, 14. n. 3, 820-833. doi:10.1109/TSC.2018.2824810

    • NLM

      Schwerz AL, Liberato R, Pu C, Ferreira JE. Robust and reliable process-aware information systems [Internet]. IEEE Transactions on Services Computing. 2021 ; 14. n. 3 820-833.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1109/TSC.2018.2824810

    • Vancouver

      Schwerz AL, Liberato R, Pu C, Ferreira JE. Robust and reliable process-aware information systems [Internet]. IEEE Transactions on Services Computing. 2021 ; 14. n. 3 820-833.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1109/TSC.2018.2824810

  • Artigo de periodico

    CodAn: predictive models for precise identification of coding regions in eukaryotic transcripts (2021)

    Nachtigall, Pedro Gabriel ; Kashiwabara, André Yoshiaki ; Durham, Alan Mitchell

    Source: Briefings in Bioinformatics. Unidade: IME

    Subjects: BIOINFORMÁTICA, SEQUENCIAMENTO GENÉTICO

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

    • ABNT

      NACHTIGALL, Pedro Gabriel e KASHIWABARA, André Yoshiaki e DURHAM, Alan Mitchell. CodAn: predictive models for precise identification of coding regions in eukaryotic transcripts. Briefings in Bioinformatics, v. 22, n. 3, p. 1-11, 2021Tradução . . Disponível em: https://doi.org/10.1093/bib/bbaa045. Acesso em: 28 jun. 2024.

    • APA

      Nachtigall, P. G., Kashiwabara, A. Y., & Durham, A. M. (2021). CodAn: predictive models for precise identification of coding regions in eukaryotic transcripts. Briefings in Bioinformatics, 22( 3), 1-11. doi:10.1093/bib/bbaa045

    • NLM

      Nachtigall PG, Kashiwabara AY, Durham AM. CodAn: predictive models for precise identification of coding regions in eukaryotic transcripts [Internet]. Briefings in Bioinformatics. 2021 ; 22( 3): 1-11.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1093/bib/bbaa045

    • Vancouver

      Nachtigall PG, Kashiwabara AY, Durham AM. CodAn: predictive models for precise identification of coding regions in eukaryotic transcripts [Internet]. Briefings in Bioinformatics. 2021 ; 22( 3): 1-11.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1093/bib/bbaa045

  • Artigo de periodico

    A framework for automatic hand range of motion evaluation of rheumatoid arthritis patients (2021)

    Cejnog, Luciano Walenty Xavier ; de Campos, Teofilo ; Elui, Valéria Meirelles Carril ; César Júnior, Roberto Marcondes

    Source: Informatics in Medicine Unlocked. Unidades: FMRP, IME

    Subjects: VISÃO COMPUTACIONAL, ARTRITE REUMATOIDE

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

    • ABNT

      CEJNOG, Luciano Walenty Xavier et al. A framework for automatic hand range of motion evaluation of rheumatoid arthritis patients. Informatics in Medicine Unlocked, v. 23, p. 1-12, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.imu.2021.100544. Acesso em: 28 jun. 2024.

    • APA

      Cejnog, L. W. X., de Campos, T., Elui, V. M. C., & César Júnior, R. M. (2021). A framework for automatic hand range of motion evaluation of rheumatoid arthritis patients. Informatics in Medicine Unlocked, 23, 1-12. doi:10.1016/j.imu.2021.100544

    • NLM

      Cejnog LWX, de Campos T, Elui VMC, César Júnior RM. A framework for automatic hand range of motion evaluation of rheumatoid arthritis patients [Internet]. Informatics in Medicine Unlocked. 2021 ; 23 1-12.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1016/j.imu.2021.100544

    • Vancouver

      Cejnog LWX, de Campos T, Elui VMC, César Júnior RM. A framework for automatic hand range of motion evaluation of rheumatoid arthritis patients [Internet]. Informatics in Medicine Unlocked. 2021 ; 23 1-12.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1016/j.imu.2021.100544

  • Artigo de periodico

    Decomposing split graphs into locally irregular graphs (2021)

    Lintzmayer, Carla Negri ; Mota‬, ‪Guilherme Oliveira ; Sambinelli, Maycon

    Source: Discrete Applied Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      LINTZMAYER, Carla Negri e MOTA‬, ‪Guilherme Oliveira e SAMBINELLI, Maycon. Decomposing split graphs into locally irregular graphs. Discrete Applied Mathematics, v. 292, p. 33-44, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2020.12.002. Acesso em: 28 jun. 2024.

    • APA

      Lintzmayer, C. N., Mota‬, ‪G. O., & Sambinelli, M. (2021). Decomposing split graphs into locally irregular graphs. Discrete Applied Mathematics, 292, 33-44. doi:10.1016/j.dam.2020.12.002

    • NLM

      Lintzmayer CN, Mota‬ ‪GO, Sambinelli M. Decomposing split graphs into locally irregular graphs [Internet]. Discrete Applied Mathematics. 2021 ; 292 33-44.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1016/j.dam.2020.12.002

    • Vancouver

      Lintzmayer CN, Mota‬ ‪GO, Sambinelli M. Decomposing split graphs into locally irregular graphs [Internet]. Discrete Applied Mathematics. 2021 ; 292 33-44.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1016/j.dam.2020.12.002

  • Artigo de periodico

    Energy-efficient vBBU migration and wavelength reassignment in cloud-fog RAN (2021)

    Tinini, Rodrigo Izidoro ; Batista, Daniel Macêdo ; Figueiredo, Gustavo Bittencourt ; Tornatore, Massimo ; Mukherjee, Biswanath

    Source: IEEE Transactions on Green Communications and Networking. Unidade: IME

    Subjects: COMPUTAÇÃO EM NUVEM, CONSERVAÇÃO DE ENERGIA ELÉTRICA

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

    • ABNT

      TININI, Rodrigo Izidoro et al. Energy-efficient vBBU migration and wavelength reassignment in cloud-fog RAN. IEEE Transactions on Green Communications and Networking, v. 5, n. 1, p. 18-28, 2021Tradução . . Disponível em: https://doi.org/10.1109/TGCN.2020.3035546. Acesso em: 28 jun. 2024.

    • APA

      Tinini, R. I., Batista, D. M., Figueiredo, G. B., Tornatore, M., & Mukherjee, B. (2021). Energy-efficient vBBU migration and wavelength reassignment in cloud-fog RAN. IEEE Transactions on Green Communications and Networking, 5( 1), 18-28. doi:10.1109/TGCN.2020.3035546

    • NLM

      Tinini RI, Batista DM, Figueiredo GB, Tornatore M, Mukherjee B. Energy-efficient vBBU migration and wavelength reassignment in cloud-fog RAN [Internet]. IEEE Transactions on Green Communications and Networking. 2021 ; 5( 1): 18-28.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1109/TGCN.2020.3035546

    • Vancouver

      Tinini RI, Batista DM, Figueiredo GB, Tornatore M, Mukherjee B. Energy-efficient vBBU migration and wavelength reassignment in cloud-fog RAN [Internet]. IEEE Transactions on Green Communications and Networking. 2021 ; 5( 1): 18-28.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1109/TGCN.2020.3035546

  • Trabalho de evento

    AnubisFlow: a feature extractor for distributed denial of service attack classification (2021)

    Barzilay, Alan ; Martinelli, Caio Lorenzetti; Nogueira, Michele ; Batista, Daniel Macêdo ; Hirata Júnior, Roberto

    Source: Proceedings. Conference titles: International Conference on Network of the Future - NoF. Unidade: IME

    Subjects: MODELOS ANALÍTICOS, CRIME POR COMPUTADOR

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

    • ABNT

      BARZILAY, Alan et al. AnubisFlow: a feature extractor for distributed denial of service attack classification. 2021, Anais.. Piscataway: IEEE, 2021. Disponível em: https://doi.org/10.1109/NoF52522.2021.9609918. Acesso em: 28 jun. 2024.

    • APA

      Barzilay, A., Martinelli, C. L., Nogueira, M., Batista, D. M., & Hirata Júnior, R. (2021). AnubisFlow: a feature extractor for distributed denial of service attack classification. In Proceedings. Piscataway: IEEE. doi:10.1109/NoF52522.2021.9609918

    • NLM

      Barzilay A, Martinelli CL, Nogueira M, Batista DM, Hirata Júnior R. AnubisFlow: a feature extractor for distributed denial of service attack classification [Internet]. Proceedings. 2021 ;[citado 2024 jun. 28 ] Available from: https://doi.org/10.1109/NoF52522.2021.9609918

    • Vancouver

      Barzilay A, Martinelli CL, Nogueira M, Batista DM, Hirata Júnior R. AnubisFlow: a feature extractor for distributed denial of service attack classification [Internet]. Proceedings. 2021 ;[citado 2024 jun. 28 ] Available from: https://doi.org/10.1109/NoF52522.2021.9609918

  • Trabalho de evento

    IoT DDoS detection based on stream learning (2021)

    Arbex, Gustavo Vitral; Machado, Kétly Gonçalves ; Nogueira, Michele ; Batista, Daniel Macêdo ; Hirata Júnior, Roberto

    Source: Proceedings. Conference titles: International Conference on Network of the Future - NoF. Unidade: IME

    Subjects: INTERNET DAS COISAS, SEGURANÇA DE REDES

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

    • ABNT

      ARBEX, Gustavo Vitral et al. IoT DDoS detection based on stream learning. 2021, Anais.. Piscataway: IEEE, 2021. Disponível em: https://doi.org/10.1109/NoF52522.2021.9609940. Acesso em: 28 jun. 2024.

    • APA

      Arbex, G. V., Machado, K. G., Nogueira, M., Batista, D. M., & Hirata Júnior, R. (2021). IoT DDoS detection based on stream learning. In Proceedings. Piscataway: IEEE. doi:10.1109/NoF52522.2021.9609940

    • NLM

      Arbex GV, Machado KG, Nogueira M, Batista DM, Hirata Júnior R. IoT DDoS detection based on stream learning [Internet]. Proceedings. 2021 ;[citado 2024 jun. 28 ] Available from: https://doi.org/10.1109/NoF52522.2021.9609940

    • Vancouver

      Arbex GV, Machado KG, Nogueira M, Batista DM, Hirata Júnior R. IoT DDoS detection based on stream learning [Internet]. Proceedings. 2021 ;[citado 2024 jun. 28 ] Available from: https://doi.org/10.1109/NoF52522.2021.9609940

  • Artigo de periodico

    Classification and evaluation of IoT brokers: a methodology (2021)

    Bertrand-Martinez, Eddas ; Dias Feio, Phelipe; Brito Nascimento, Vagner de; Kon, Fábio ; Abelém, Antônio

    Source: International Journal of Network Management. Unidade: IME

    Assunto: INTERNET DAS COISAS

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

    • ABNT

      BERTRAND-MARTINEZ, Eddas et al. Classification and evaluation of IoT brokers: a methodology. International Journal of Network Management, v. 31, n. 3, 2021Tradução . . Disponível em: https://doi.org/10.1002/nem.2115. Acesso em: 28 jun. 2024.

    • APA

      Bertrand-Martinez, E., Dias Feio, P., Brito Nascimento, V. de, Kon, F., & Abelém, A. (2021). Classification and evaluation of IoT brokers: a methodology. International Journal of Network Management, 31( 3). doi:10.1002/nem.2115

    • NLM

      Bertrand-Martinez E, Dias Feio P, Brito Nascimento V de, Kon F, Abelém A. Classification and evaluation of IoT brokers: a methodology [Internet]. International Journal of Network Management. 2021 ; 31( 3):[citado 2024 jun. 28 ] Available from: https://doi.org/10.1002/nem.2115

    • Vancouver

      Bertrand-Martinez E, Dias Feio P, Brito Nascimento V de, Kon F, Abelém A. Classification and evaluation of IoT brokers: a methodology [Internet]. International Journal of Network Management. 2021 ; 31( 3):[citado 2024 jun. 28 ] Available from: https://doi.org/10.1002/nem.2115

  • Artigo de periodico

    Near-perfect clique-factors in sparse pseudorandom graphs (2021)

    Han, Jie ; Kohayakawa, Yoshiharu ; Person, Yury

    Source: Combinatorics, Probability & Computing. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, PROGRAMAÇÃO MATEMÁTICA

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

    • ABNT

      HAN, Jie e KOHAYAKAWA, Yoshiharu e PERSON, Yury. Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability & Computing, v. 30, n. 4, p. 570-590, 2021Tradução . . Disponível em: https://doi.org/10.1017/S0963548320000577. Acesso em: 28 jun. 2024.

    • APA

      Han, J., Kohayakawa, Y., & Person, Y. (2021). Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability & Computing, 30( 4), 570-590. doi:10.1017/S0963548320000577

    • NLM

      Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability & Computing. 2021 ; 30( 4): 570-590.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1017/S0963548320000577

    • Vancouver

      Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability & Computing. 2021 ; 30( 4): 570-590.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1017/S0963548320000577

  • Artigo de periodico

    On the solution of linearly constrained optimization problems by means of barrier algorithms (2021)

    Birgin, Ernesto Julian Goldberg ; Gardenghi, John Lenon Cardoso ; Martínez, José Mário ; Santos, S. A

    Source: TOP. Unidade: IME

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

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

    • ABNT

      BIRGIN, Ernesto Julian Goldberg et al. On the solution of linearly constrained optimization problems by means of barrier algorithms. TOP, v. 29, n. 2, p. 417-441, 2021Tradução . . Disponível em: https://doi.org/10.1007/s11750-020-00559-w. Acesso em: 28 jun. 2024.

    • APA

      Birgin, E. J. G., Gardenghi, J. L. C., Martínez, J. M., & Santos, S. A. (2021). On the solution of linearly constrained optimization problems by means of barrier algorithms. TOP, 29( 2), 417-441. doi:10.1007/s11750-020-00559-w

    • NLM

      Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the solution of linearly constrained optimization problems by means of barrier algorithms [Internet]. TOP. 2021 ; 29( 2): 417-441.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1007/s11750-020-00559-w

    • Vancouver

      Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the solution of linearly constrained optimization problems by means of barrier algorithms [Internet]. TOP. 2021 ; 29( 2): 417-441.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1007/s11750-020-00559-w

  • Artigo de periodico

    Melatonin-Index as a biomarker for predicting the distribution of presymptomatic and asymptomatic SARS-CoV-2 carriers (2021)

    Fernandes, Pedro Augusto ; Kinker, Gabriela Sarti ; Navarro, Bruno Viana; Carvalho, Vinícius Jardim; Paz, Edson Duarte Ribeiro; Córdoba-Moreno, Marlina Olyissa ; Santos-Silva, Débora; Muxel, Sandra Márcia ; Fujita, André ; Moraes, Carolina Borsoi ; Nakaya, Helder Takashi Imoto ; Buckeridge, Marcos ; Markus, Regina P

    Source: Melatonin Research. Unidades: IB, IME, FCF, BIOINFORMÁTICA

    Subjects: MELATONINA, DOENÇAS INFECCIOSAS

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

    • ABNT

      FERNANDES, Pedro Augusto et al. Melatonin-Index as a biomarker for predicting the distribution of presymptomatic and asymptomatic SARS-CoV-2 carriers. Melatonin Research, v. 24, n. 1, p. 189-205, 2021Tradução . . Disponível em: https://doi.org/10.32794/mr11250090. Acesso em: 28 jun. 2024.

    • APA

      Fernandes, P. A., Kinker, G. S., Navarro, B. V., Carvalho, V. J., Paz, E. D. R., Córdoba-Moreno, M. O., et al. (2021). Melatonin-Index as a biomarker for predicting the distribution of presymptomatic and asymptomatic SARS-CoV-2 carriers. Melatonin Research, 24( 1), 189-205. doi:10.32794/mr11250090

    • NLM

      Fernandes PA, Kinker GS, Navarro BV, Carvalho VJ, Paz EDR, Córdoba-Moreno MO, Santos-Silva D, Muxel SM, Fujita A, Moraes CB, Nakaya HTI, Buckeridge M, Markus RP. Melatonin-Index as a biomarker for predicting the distribution of presymptomatic and asymptomatic SARS-CoV-2 carriers [Internet]. Melatonin Research. 2021 ; 24( 1): 189-205.[citado 2024 jun. 28 ] Available from: https://doi.org/10.32794/mr11250090

    • Vancouver

      Fernandes PA, Kinker GS, Navarro BV, Carvalho VJ, Paz EDR, Córdoba-Moreno MO, Santos-Silva D, Muxel SM, Fujita A, Moraes CB, Nakaya HTI, Buckeridge M, Markus RP. Melatonin-Index as a biomarker for predicting the distribution of presymptomatic and asymptomatic SARS-CoV-2 carriers [Internet]. Melatonin Research. 2021 ; 24( 1): 189-205.[citado 2024 jun. 28 ] Available from: https://doi.org/10.32794/mr11250090

  • Artigo de periodico

    On Tuza’s conjecture for triangulations and graphs with small treewidth (2021)

    Botler, Fábio Happ ; Fernandes, Cristina Gomes ; Gutiérrez, Juan

    Source: Discrete Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      BOTLER, Fábio Happ e FERNANDES, Cristina Gomes e GUTIÉRREZ, Juan. On Tuza’s conjecture for triangulations and graphs with small treewidth. Discrete Mathematics, v. 344, n. 4, p. 1-12, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2020.112281. Acesso em: 28 jun. 2024.

    • APA

      Botler, F. H., Fernandes, C. G., & Gutiérrez, J. (2021). On Tuza’s conjecture for triangulations and graphs with small treewidth. Discrete Mathematics, 344( 4), 1-12. doi:10.1016/j.disc.2020.112281

    • NLM

      Botler FH, Fernandes CG, Gutiérrez J. On Tuza’s conjecture for triangulations and graphs with small treewidth [Internet]. Discrete Mathematics. 2021 ; 344( 4): 1-12.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1016/j.disc.2020.112281

    • Vancouver

      Botler FH, Fernandes CG, Gutiérrez J. On Tuza’s conjecture for triangulations and graphs with small treewidth [Internet]. Discrete Mathematics. 2021 ; 344( 4): 1-12.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1016/j.disc.2020.112281

  • Artigo de periodico

    A comprehensive benchmark analysis of single image deraining: current challenges and future perspectives (2021)

    Li, Siyuan ; Ren, Wenqi ; Wang, Feng; Araujo, Iago Breno ; Tokuda, Eric Keiji ; Hirata Júnior, Roberto ; César Júnior, Roberto Marcondes ; Wang, Zhangyang ; Cao, Xiaochun

    Source: International Journal of Computer Vision. Unidade: IME

    Assunto: PROCESSAMENTO DE IMAGENS

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

    • ABNT

      LI, Siyuan et al. A comprehensive benchmark analysis of single image deraining: current challenges and future perspectives. International Journal of Computer Vision, v. 126, p. 1-22, 2021Tradução . . Disponível em: https://doi.org/10.1007/s11263-020-01416-w. Acesso em: 28 jun. 2024.

    • APA

      Li, S., Ren, W., Wang, F., Araujo, I. B., Tokuda, E. K., Hirata Júnior, R., et al. (2021). A comprehensive benchmark analysis of single image deraining: current challenges and future perspectives. International Journal of Computer Vision, 126, 1-22. doi:10.1007/s11263-020-01416-w

    • NLM

      Li S, Ren W, Wang F, Araujo IB, Tokuda EK, Hirata Júnior R, César Júnior RM, Wang Z, Cao X. A comprehensive benchmark analysis of single image deraining: current challenges and future perspectives [Internet]. International Journal of Computer Vision. 2021 ; 126 1-22.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1007/s11263-020-01416-w

    • Vancouver

      Li S, Ren W, Wang F, Araujo IB, Tokuda EK, Hirata Júnior R, César Júnior RM, Wang Z, Cao X. A comprehensive benchmark analysis of single image deraining: current challenges and future perspectives [Internet]. International Journal of Computer Vision. 2021 ; 126 1-22.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1007/s11263-020-01416-w

  • Artigo de periodico

    Finding any given 2-factor in sparse pseudorandom graphs efficiently (2021)

    Han, Jie ; Kohayakawa, Yoshiharu ; Morris, Patrick; Person, Yury

    Source: Journal of Graph Theory. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      HAN, Jie et al. Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, v. 96, n. 1, p. 87-108, 2021Tradução . . Disponível em: https://doi.org/10.1002/jgt.22576. Acesso em: 28 jun. 2024.

    • APA

      Han, J., Kohayakawa, Y., Morris, P., & Person, Y. (2021). Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, 96( 1), 87-108. doi:10.1002/jgt.22576

    • NLM

      Han J, Kohayakawa Y, Morris P, Person Y. Finding any given 2-factor in sparse pseudorandom graphs efficiently [Internet]. Journal of Graph Theory. 2021 ; 96( 1): 87-108.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1002/jgt.22576

    • Vancouver

      Han J, Kohayakawa Y, Morris P, Person Y. Finding any given 2-factor in sparse pseudorandom graphs efficiently [Internet]. Journal of Graph Theory. 2021 ; 96( 1): 87-108.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1002/jgt.22576

  • Artigo de periodico

    On constrained optimization with nonconvex regularization (2021)

    Birgin, Ernesto Julian Goldberg ; Martínez, José Mário ; Ramos, Alberto

    Source: Numerical Algorithms. Unidade: IME

    Subjects: OTIMIZAÇÃO NÃO LINEAR, COMPUTABILIDADE E COMPLEXIDADE

    Versão AceitaAcesso à 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 MARTÍNEZ, José Mário e RAMOS, Alberto. On constrained optimization with nonconvex regularization. Numerical Algorithms, v. 86, n. 3, p. 1165-1188, 2021Tradução . . Disponível em: https://doi.org/10.1007/s11075-020-00928-3. Acesso em: 28 jun. 2024.

    • APA

      Birgin, E. J. G., Martínez, J. M., & Ramos, A. (2021). On constrained optimization with nonconvex regularization. Numerical Algorithms, 86( 3), 1165-1188. doi:10.1007/s11075-020-00928-3

    • NLM

      Birgin EJG, Martínez JM, Ramos A. On constrained optimization with nonconvex regularization [Internet]. Numerical Algorithms. 2021 ; 86( 3): 1165-1188.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1007/s11075-020-00928-3

    • Vancouver

      Birgin EJG, Martínez JM, Ramos A. On constrained optimization with nonconvex regularization [Internet]. Numerical Algorithms. 2021 ; 86( 3): 1165-1188.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1007/s11075-020-00928-3

  • Artigo de periodico

    A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis (2021)

    Jorge, Carlos Antônio Campos ; Nery, Alexandre S.; Melo, Alba Cristina Magalhães Alves de ; Goldman, Alfredo

    Source: Concurrency and Computation: Practice and Experience. Unidade: IME

    Subjects: ALGORITMOS PARA PROCESSAMENTO, PROGRAMAÇÃO DINÂMICA

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

    • ABNT

      JORGE, Carlos Antônio Campos et al. A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis. Concurrency and Computation: Practice and Experience, v. 33, n. 4, 2021Tradução . . Disponível em: https://doi.org/10.1002/cpe.6007. Acesso em: 28 jun. 2024.

    • APA

      Jorge, C. A. C., Nery, A. S., Melo, A. C. M. A. de, & Goldman, A. (2021). A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis. Concurrency and Computation: Practice and Experience, 33( 4). doi:10.1002/cpe.6007

    • NLM

      Jorge CAC, Nery AS, Melo ACMA de, Goldman A. A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis [Internet]. Concurrency and Computation: Practice and Experience. 2021 ; 33( 4):[citado 2024 jun. 28 ] Available from: https://doi.org/10.1002/cpe.6007

    • Vancouver

      Jorge CAC, Nery AS, Melo ACMA de, Goldman A. A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis [Internet]. Concurrency and Computation: Practice and Experience. 2021 ; 33( 4):[citado 2024 jun. 28 ] Available from: https://doi.org/10.1002/cpe.6007

  • Artigo de periodico

    Metaheuristics for the online printing shop scheduling problem (2021)

    Lunardi, Willian Tessaro ; Birgin, Ernesto Julian Goldberg ; Ronconi, Débora Pretti ; Voos, Holger

    Source: European Journal of Operational Research. Unidades: IME, EP

    Subjects: PROGRAMAÇÃO MATEMÁTICA, SCHEDULING

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

    • ABNT

      LUNARDI, Willian Tessaro et al. Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, v. 293, n. 2, p. 419-441, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.12.021. Acesso em: 28 jun. 2024.

    • APA

      Lunardi, W. T., Birgin, E. J. G., Ronconi, D. P., & Voos, H. (2021). Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, 293( 2), 419-441. doi:10.1016/j.ejor.2020.12.021

    • NLM

      Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021

    • Vancouver

      Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021

  • Artigo de periodico

    Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon (2021)

    Fernandes, Cristina Gomes ; Pina Júnior, José Coelho de; Ramírez Alfonsín, Jorge Luis; Robins, Sinai

    Source: Discrete & Computational Geometry. Unidade: IME

    Subjects: ENUMERAÇÃO E IDENTIDADE COMBINATÓRIAS, TEORIA DOS GRAFOS

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

    • ABNT

      FERNANDES, Cristina Gomes et al. Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon. Discrete & Computational Geometry, v. 65, n. 1, p. 227-243, 2021Tradução . . Disponível em: https://doi.org/10.1007/s00454-020-00192-1. Acesso em: 28 jun. 2024.

    • APA

      Fernandes, C. G., Pina Júnior, J. C. de, Ramírez Alfonsín, J. L., & Robins, S. (2021). Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon. Discrete & Computational Geometry, 65( 1), 227-243. doi:10.1007/s00454-020-00192-1

    • NLM

      Fernandes CG, Pina Júnior JC de, Ramírez Alfonsín JL, Robins S. Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon [Internet]. Discrete & Computational Geometry. 2021 ; 65( 1): 227-243.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1007/s00454-020-00192-1

    • Vancouver

      Fernandes CG, Pina Júnior JC de, Ramírez Alfonsín JL, Robins S. Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon [Internet]. Discrete & Computational Geometry. 2021 ; 65( 1): 227-243.[citado 2024 jun. 28 ] Available from: https://doi.org/10.1007/s00454-020-00192-1

1 - 20 (604 records)

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