Menu

Filtros : "Universidade Estadual de Campinas (UNICAMP)" "IME-MAC" Removidos: " IFSC333" "vi" Limpar

Filtros

Refine with date range

1 - 20 (85 records)

  • Artigo de periodico

    Enabling HW-based task scheduling in large multicore architectures (2024)

    Morais, Lucas; Álvarez, Carlos; Jiménez-González, Daniel; de Haro, Juan Miguel; Araujo , Guido ; Frank, Michael; Goldman, Alfredo ; Martorell, Xavier

    Source: IEEE Transactions on Computers. Unidade: IME

    Subjects: PROGRAMAÇÃO PARALELA, GEOMETRIA E MODELAGEM COMPUTACIONAL

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

    • ABNT

      MORAIS, Lucas et al. Enabling HW-based task scheduling in large multicore architectures. IEEE Transactions on Computers, v. 73, n. 1, p. 1138-151, 2024Tradução . . Disponível em: https://doi.org/10.1109/TC.2023.3323781. Acesso em: 01 jul. 2024.

    • APA

      Morais, L., Álvarez, C., Jiménez-González, D., de Haro, J. M., Araujo , G., Frank, M., et al. (2024). Enabling HW-based task scheduling in large multicore architectures. IEEE Transactions on Computers, 73( 1), 1138-151. doi:10.1109/TC.2023.3323781

    • NLM

      Morais L, Álvarez C, Jiménez-González D, de Haro JM, Araujo G, Frank M, Goldman A, Martorell X. Enabling HW-based task scheduling in large multicore architectures [Internet]. IEEE Transactions on Computers. 2024 ; 73( 1): 1138-151.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1109/TC.2023.3323781

    • Vancouver

      Morais L, Álvarez C, Jiménez-González D, de Haro JM, Araujo G, Frank M, Goldman A, Martorell X. Enabling HW-based task scheduling in large multicore architectures [Internet]. IEEE Transactions on Computers. 2024 ; 73( 1): 1138-151.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1109/TC.2023.3323781

  • Artigo de periodico

    A PDE-informed optimization algorithm for river flow predictions (2024)

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

    Source: Numerical Algorithms. Unidade: IME

    Subjects: OTIMIZAÇÃO MATEMÁTICA, ALGORITMOS

    Disponível em 2024-09-07Acesso à 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. A PDE-informed optimization algorithm for river flow predictions. Numerical Algorithms, v. 96, n. 1, p. 289-304, 2024Tradução . . Disponível em: https://doi.org/10.1007/s11075-023-01647-1. Acesso em: 01 jul. 2024.

    • APA

      Birgin, E. J. G., & Martínez, J. M. (2024). A PDE-informed optimization algorithm for river flow predictions. Numerical Algorithms, 96( 1), 289-304. doi:10.1007/s11075-023-01647-1

    • NLM

      Birgin EJG, Martínez JM. A PDE-informed optimization algorithm for river flow predictions [Internet]. Numerical Algorithms. 2024 ; 96( 1): 289-304.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/s11075-023-01647-1

    • Vancouver

      Birgin EJG, Martínez JM. A PDE-informed optimization algorithm for river flow predictions [Internet]. Numerical Algorithms. 2024 ; 96( 1): 289-304.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/s11075-023-01647-1

  • Artigo de periodico-carta/editorial

    Guest editorial: special issue on theoretical informatics (2023)

    Kohayakawa, Yoshiharu ; Miyazawa, Flavio Keidi

    Source: Algorithmica. Unidade: IME

    Subjects: EDITORIAL, TEORIA DA COMPUTAÇÃO

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

    • ABNT

      KOHAYAKAWA, Yoshiharu e MIYAZAWA, Flavio Keidi. Guest editorial: special issue on theoretical informatics. Algorithmica. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/s00453-023-01101-7. Acesso em: 01 jul. 2024. , 2023

    • APA

      Kohayakawa, Y., & Miyazawa, F. K. (2023). Guest editorial: special issue on theoretical informatics. Algorithmica. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1007/s00453-023-01101-7

    • NLM

      Kohayakawa Y, Miyazawa FK. Guest editorial: special issue on theoretical informatics [Internet]. Algorithmica. 2023 ; 85( 8): 2482-2484.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/s00453-023-01101-7

    • Vancouver

      Kohayakawa Y, Miyazawa FK. Guest editorial: special issue on theoretical informatics [Internet]. Algorithmica. 2023 ; 85( 8): 2482-2484.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/s00453-023-01101-7

  • Artigo de periodico

    Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs (2023)

    Gómez, Renzo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko

    Source: Theoretical Computer Science. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, TEORIA DA COMPUTAÇÃO

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

    • ABNT

      GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs. Theoretical Computer Science, v. 947, n. artigo 113691, p. 1-13, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2023.113691. Acesso em: 01 jul. 2024.

    • APA

      Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2023). Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs. Theoretical Computer Science, 947( artigo 113691), 1-13. doi:10.1016/j.tcs.2023.113691

    • NLM

      Gómez R, Miyazawa FK, Wakabayashi Y. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs [Internet]. Theoretical Computer Science. 2023 ; 947( artigo 113691): 1-13.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1016/j.tcs.2023.113691

    • Vancouver

      Gómez R, Miyazawa FK, Wakabayashi Y. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs [Internet]. Theoretical Computer Science. 2023 ; 947( artigo 113691): 1-13.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1016/j.tcs.2023.113691

  • Trabalho de evento-resumo

    Block coordinate descent for smooth nonconvex constrained minimization (2023)

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

    Source: Abstracts. Conference titles: Conference on Optimization - OP23. Unidade: IME

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

    PrivadoAcesso à fonteHow 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. Block coordinate descent for smooth nonconvex constrained minimization. 2023, Anais.. Philadelphia: SIAM, 2023. Disponível em: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf. Acesso em: 01 jul. 2024.

    • APA

      Birgin, E. J. G., & Martínez, J. M. (2023). Block coordinate descent for smooth nonconvex constrained minimization. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf

    • NLM

      Birgin EJG, Martínez JM. Block coordinate descent for smooth nonconvex constrained minimization [Internet]. Abstracts. 2023 ;[citado 2024 jul. 01 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf

    • Vancouver

      Birgin EJG, Martínez JM. Block coordinate descent for smooth nonconvex constrained minimization [Internet]. Abstracts. 2023 ;[citado 2024 jul. 01 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf

  • Trabalho de evento

    Minimum t-spanners on subcubic graphs (2022)

    Gómez, Renzo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko

    Source: Proceedings. Conference titles: International Conference and Workshops on Algorithms and Computation - WALCOM. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, APROXIMAÇÃO POR POLINÔMIOS

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

    • ABNT

      GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Minimum t-spanners on subcubic graphs. 2022, Anais.. Cham: Springer, 2022. Disponível em: https://doi.org/10.1007/978-3-030-96731-4_30. Acesso em: 01 jul. 2024.

    • APA

      Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2022). Minimum t-spanners on subcubic graphs. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-96731-4_30

    • NLM

      Gómez R, Miyazawa FK, Wakabayashi Y. Minimum t-spanners on subcubic graphs [Internet]. Proceedings. 2022 ;[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/978-3-030-96731-4_30

    • Vancouver

      Gómez R, Miyazawa FK, Wakabayashi Y. Minimum t-spanners on subcubic graphs [Internet]. Proceedings. 2022 ;[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/978-3-030-96731-4_30

  • Artigo de periodico

    Techniques and results on approximation algorithms for packing circles (2022)

    Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko

    Source: São Paulo Journal of Mathematical Sciences. Unidade: IME

    Subjects: ALGORITMOS DE APROXIMAÇÃO, 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

      MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Techniques and results on approximation algorithms for packing circles. São Paulo Journal of Mathematical Sciences, v. 16, n. 1, p. 585-615, 2022Tradução . . Disponível em: https://doi.org/10.1007/s40863-022-00301-3. Acesso em: 01 jul. 2024.

    • APA

      Miyazawa, F. K., & Wakabayashi, Y. (2022). Techniques and results on approximation algorithms for packing circles. São Paulo Journal of Mathematical Sciences, 16( 1), 585-615. doi:10.1007/s40863-022-00301-3

    • NLM

      Miyazawa FK, Wakabayashi Y. Techniques and results on approximation algorithms for packing circles [Internet]. São Paulo Journal of Mathematical Sciences. 2022 ; 16( 1): 585-615.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/s40863-022-00301-3

    • Vancouver

      Miyazawa FK, Wakabayashi Y. Techniques and results on approximation algorithms for packing circles [Internet]. São Paulo Journal of Mathematical Sciences. 2022 ; 16( 1): 585-615.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/s40863-022-00301-3

  • Trabalho de evento

    Tree 3-spanners on generalized prisms of graphs (2022)

    Gómez, Renzo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko

    Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Tree 3-spanners on generalized prisms of graphs. 2022, Anais.. Cham: Springer, 2022. Disponível em: https://doi.org/10.1007/978-3-031-20624-5_34. Acesso em: 01 jul. 2024.

    • APA

      Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2022). Tree 3-spanners on generalized prisms of graphs. In Proceedings. Cham: Springer. doi:10.1007/978-3-031-20624-5_34

    • NLM

      Gómez R, Miyazawa FK, Wakabayashi Y. Tree 3-spanners on generalized prisms of graphs [Internet]. Proceedings. 2022 ;[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/978-3-031-20624-5_34

    • Vancouver

      Gómez R, Miyazawa FK, Wakabayashi Y. Tree 3-spanners on generalized prisms of graphs [Internet]. Proceedings. 2022 ;[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/978-3-031-20624-5_34

  • Trabalho de evento

    Improving deep learning projections by neighborhood analysis (2022)

    Modrakowski, Terri S ; Espadoto, Mateus ; Falcão, Alexandre Xavier ; Hirata, Nina Sumiko Tomita ; Telea, Alexandru Cristian

    Source: Proceedings. Conference titles: International Joint Conference on Computer Vision, Imaging and Computer Graphics - VISIGRAPP. Unidade: IME

    Subjects: APRENDIZAGEM PROFUNDA, REDES NEURAIS

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

    • ABNT

      MODRAKOWSKI, Terri S et al. Improving deep learning projections by neighborhood analysis. 2022, Anais.. Cham: Springer, 2022. Disponível em: https://doi.org/10.1007/978-3-030-94893-1_6. Acesso em: 01 jul. 2024.

    • APA

      Modrakowski, T. S., Espadoto, M., Falcão, A. X., Hirata, N. S. T., & Telea, A. C. (2022). Improving deep learning projections by neighborhood analysis. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-94893-1_6

    • NLM

      Modrakowski TS, Espadoto M, Falcão AX, Hirata NST, Telea AC. Improving deep learning projections by neighborhood analysis [Internet]. Proceedings. 2022 ;[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/978-3-030-94893-1_6

    • Vancouver

      Modrakowski TS, Espadoto M, Falcão AX, Hirata NST, Telea AC. Improving deep learning projections by neighborhood analysis [Internet]. Proceedings. 2022 ;[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/978-3-030-94893-1_6

  • Artigo de periodico

    Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations (2022)

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

    Source: SIAM Journal on Numerical Analysis. Unidade: IME

    Subjects: ANÁLISE NUMÉRICA, PESQUISA OPERACIONAL

    Acesso à 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. Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations. SIAM Journal on Numerical Analysis, v. 60, n. 6, p. 3145-3180, 2022Tradução . . Disponível em: https://doi.org/10.1137/20M1388024. Acesso em: 01 jul. 2024.

    • APA

      Birgin, E. J. G., & Martínez, J. M. (2022). Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations. SIAM Journal on Numerical Analysis, 60( 6), 3145-3180. doi:10.1137/20M1388024

    • NLM

      Birgin EJG, Martínez JM. Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations [Internet]. SIAM Journal on Numerical Analysis. 2022 ; 60( 6): 3145-3180.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1137/20M1388024

    • Vancouver

      Birgin EJG, Martínez JM. Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations [Internet]. SIAM Journal on Numerical Analysis. 2022 ; 60( 6): 3145-3180.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1137/20M1388024

  • Artigo de periodico

    From mathematical morphology to machine learning of image operators (2022)

    Barrera, Junior ; Hashimoto, Ronaldo Fumio ; Hirata, Nina Sumiko Tomita ; Hirata Júnior, Roberto ; Reis, Marcelo S.

    Source: São Paulo Journal of Mathematical Sciences. Unidade: IME

    Subjects: METODOLOGIA E TÉCNICAS DE COMPUTAÇÃO, PROCESSAMENTO DE IMAGENS

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

    • ABNT

      BARRERA, Junior et al. From mathematical morphology to machine learning of image operators. São Paulo Journal of Mathematical Sciences, 2022Tradução . . Disponível em: https://doi.org/10.1007/s40863-022-00303-1. Acesso em: 01 jul. 2024.

    • APA

      Barrera, J., Hashimoto, R. F., Hirata, N. S. T., Hirata Júnior, R., & Reis, M. S. (2022). From mathematical morphology to machine learning of image operators. São Paulo Journal of Mathematical Sciences. doi:10.1007/s40863-022-00303-1

    • NLM

      Barrera J, Hashimoto RF, Hirata NST, Hirata Júnior R, Reis MS. From mathematical morphology to machine learning of image operators [Internet]. São Paulo Journal of Mathematical Sciences. 2022 ;[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/s40863-022-00303-1

    • Vancouver

      Barrera J, Hashimoto RF, Hirata NST, Hirata Júnior R, Reis MS. From mathematical morphology to machine learning of image operators [Internet]. São Paulo Journal of Mathematical Sciences. 2022 ;[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/s40863-022-00303-1

  • Artigo de periodico

    A tight lower bound for the online bounded space hypercube bin packing problem (2021)

    Kohayakawa, Yoshiharu ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko

    Source: Discrete Mathematics & Theoretical Computer Science. Unidade: IME

    Subjects: TEORIA DA COMPUTAÇÃO, ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA, COMBINATÓRIA PROBABILÍSTICA

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

    • ABNT

      KOHAYAKAWA, Yoshiharu e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. A tight lower bound for the online bounded space hypercube bin packing problem. Discrete Mathematics & Theoretical Computer Science, v. 23, n. 3, p. 1-13, 2021Tradução . . Disponível em: https://doi.org/10.46298/dmtcs.8325. Acesso em: 01 jul. 2024.

    • APA

      Kohayakawa, Y., Miyazawa, F. K., & Wakabayashi, Y. (2021). A tight lower bound for the online bounded space hypercube bin packing problem. Discrete Mathematics & Theoretical Computer Science, 23( 3), 1-13. doi:10.46298/dmtcs.8325

    • NLM

      Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for the online bounded space hypercube bin packing problem [Internet]. Discrete Mathematics & Theoretical Computer Science. 2021 ; 23( 3): 1-13.[citado 2024 jul. 01 ] Available from: https://doi.org/10.46298/dmtcs.8325

    • Vancouver

      Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for the online bounded space hypercube bin packing problem [Internet]. Discrete Mathematics & Theoretical Computer Science. 2021 ; 23( 3): 1-13.[citado 2024 jul. 01 ] Available from: https://doi.org/10.46298/dmtcs.8325

  • Editor de periodico

    Procedia Computer Science (2021)

    Ferreira, Carlos Eduardo (Editor) ; Lee, Orlando (Editor) ; Miyazawa, Flavio Keidi (Editor)

    Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: CIÊNCIA DA COMPUTAÇÃO

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

    • ABNT

      Procedia Computer Science. . Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C. Acesso em: 01 jul. 2024. , 2021

    • APA

      Procedia Computer Science. (2021). Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C

    • NLM

      Procedia Computer Science [Internet]. 2021 ; 195 1-542.[citado 2024 jul. 01 ] Available from: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C

    • Vancouver

      Procedia Computer Science [Internet]. 2021 ; 195 1-542.[citado 2024 jul. 01 ] Available from: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C

  • Artigo de periodico-apres/intr

    Preface to the Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. [Editorial] (2021)

    Ferreira, Carlos Eduardo ; Lee, Orlando ; Miyazawa, Flavio Keidi (Editor)

    Source: Procedia Computer Science. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: CIÊNCIA DA COMPUTAÇÃO

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

    • ABNT

      FERREIRA, Carlos Eduardo e LEE, Orlando. Preface to the Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. [Editorial]. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.procs.2021.11.005. Acesso em: 01 jul. 2024. , 2021

    • APA

      Ferreira, C. E., & Lee, O. (2021). Preface to the Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. [Editorial]. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.procs.2021.11.005

    • NLM

      Ferreira CE, Lee O. Preface to the Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. [Editorial] [Internet]. Procedia Computer Science. 2021 ; 195 5-11.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1016/j.procs.2021.11.005

    • Vancouver

      Ferreira CE, Lee O. Preface to the Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. [Editorial] [Internet]. Procedia Computer Science. 2021 ; 195 5-11.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1016/j.procs.2021.11.005

  • Artigo de periodico

    Partitioning a graph into balanced connected classes: Formulations, separation and experiments (2021)

    Miyazawa, Flavio Keidi ; Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko

    Source: European Journal of Operational Research. 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

      MIYAZAWA, Flavio Keidi et al. Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, v. 293, n. 3, p. 826-836, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.12.059. Acesso em: 01 jul. 2024.

    • APA

      Miyazawa, F. K., Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2021). Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, 293( 3), 826-836. doi:10.1016/j.ejor.2020.12.059

    • NLM

      Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ; 293( 3): 826-836.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.059

    • Vancouver

      Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ; 293( 3): 826-836.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.059

  • Trabalho de evento

    Improving neural network-based multidimensional projections (2020)

    Espadoto, Mateus ; Hirata, Nina Sumiko Tomita ; Falcão, Alexandre Xavier ; Telea, Alexandru Cristian

    Source: Proceedings. Conference titles: International joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - VISIGRAPP. Unidade: IME

    Subjects: APRENDIZADO COMPUTACIONAL, REDES NEURAIS

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

    • ABNT

      ESPADOTO, Mateus et al. Improving neural network-based multidimensional projections. 2020, Anais.. Lisboa: SciTePress, 2020. Disponível em: https://doi.org/10.5220/0008877200290041. Acesso em: 01 jul. 2024.

    • APA

      Espadoto, M., Hirata, N. S. T., Falcão, A. X., & Telea, A. C. (2020). Improving neural network-based multidimensional projections. In Proceedings. Lisboa: SciTePress. doi:10.5220/0008877200290041

    • NLM

      Espadoto M, Hirata NST, Falcão AX, Telea AC. Improving neural network-based multidimensional projections [Internet]. Proceedings. 2020 ;[citado 2024 jul. 01 ] Available from: https://doi.org/10.5220/0008877200290041

    • Vancouver

      Espadoto M, Hirata NST, Falcão AX, Telea AC. Improving neural network-based multidimensional projections [Internet]. Proceedings. 2020 ;[citado 2024 jul. 01 ] Available from: https://doi.org/10.5220/0008877200290041

  • Monografia/livro-ed/org

    LATIN 2020: theoretical informatics (2020)

    Kohayakawa, Yoshiharu (Editor) ; Miyazawa, Flavio Keidi (Editor)

    Conference titles: Latin American Symposium - LATIN. Unidade: IME

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

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

    • ABNT

      LATIN 2020: theoretical informatics. . Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-61792-9. Acesso em: 01 jul. 2024. , 2020

    • APA

      LATIN 2020: theoretical informatics. (2020). LATIN 2020: theoretical informatics. Cham: Springer. doi:10.1007/978-3-030-61792-9

    • NLM

      LATIN 2020: theoretical informatics [Internet]. 2020 ;[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/978-3-030-61792-9

    • Vancouver

      LATIN 2020: theoretical informatics [Internet]. 2020 ;[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/978-3-030-61792-9

  • Artigo de periodico

    On the use of third-order models with fourth-order regularization for unconstrained optimization (2020)

    Birgin, Ernesto Julian Goldberg ; Gardenghi, John Lenon Cardoso ; Martínez, José Mário ; Santos, Sandra Augusta

    Source: Optimization Letters. Unidade: IME

    Assunto: OTIMIZAÇÃ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 use of third-order models with fourth-order regularization for unconstrained optimization. Optimization Letters, v. 14, n. 4, p. 815-838, 2020Tradução . . Disponível em: https://doi.org/10.1007/s11590-019-01395-z. Acesso em: 01 jul. 2024.

    • APA

      Birgin, E. J. G., Gardenghi, J. L. C., Martínez, J. M., & Santos, S. A. (2020). On the use of third-order models with fourth-order regularization for unconstrained optimization. Optimization Letters, 14( 4), 815-838. doi:10.1007/s11590-019-01395-z

    • NLM

      Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the use of third-order models with fourth-order regularization for unconstrained optimization [Internet]. Optimization Letters. 2020 ; 14( 4): 815-838.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/s11590-019-01395-z

    • Vancouver

      Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the use of third-order models with fourth-order regularization for unconstrained optimization [Internet]. Optimization Letters. 2020 ; 14( 4): 815-838.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1007/s11590-019-01395-z

  • Parte de monografia/livro-apres/pref/posf

    We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio] (2020)

    Kohayakawa, Yoshiharu (Prefácio) ; Miyazawa, Flavio Keidi (Prefácio)

    Source: LATIN 2020 : theoretical informatics. Conference titles: Latin American Symposium - LATIN. Unidade: IME

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

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

    • ABNT

      We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. LATIN 2020 : theoretical informatics. Cham: Springer. Disponível em: https://repositorio.usp.br/directbitstream/b44adcbc-47ff-4f28-bb1e-7df7bf15a8a0/3016802.pdf. Acesso em: 01 jul. 2024. , 2020

    • APA

      We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. (2020). We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. LATIN 2020 : theoretical informatics. Cham: Springer. Recuperado de https://repositorio.usp.br/directbitstream/b44adcbc-47ff-4f28-bb1e-7df7bf15a8a0/3016802.pdf

    • NLM

      We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio] [Internet]. LATIN 2020 : theoretical informatics. 2020 ;[citado 2024 jul. 01 ] Available from: https://repositorio.usp.br/directbitstream/b44adcbc-47ff-4f28-bb1e-7df7bf15a8a0/3016802.pdf

    • Vancouver

      We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio] [Internet]. LATIN 2020 : theoretical informatics. 2020 ;[citado 2024 jul. 01 ] Available from: https://repositorio.usp.br/directbitstream/b44adcbc-47ff-4f28-bb1e-7df7bf15a8a0/3016802.pdf

  • Trabalho de evento-anais periodico

    Strong intractability results for generalized convex recoloring problems (2020)

    Moura, Phablo Fernando Soares ; Wakabayashi, Yoshiko

    Source: Discrete Applied Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

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

    Versão AceitaAcesso à 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 WAKABAYASHI, Yoshiko. Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.dam.2019.08.002. Acesso em: 01 jul. 2024. , 2020

    • APA

      Moura, P. F. S., & Wakabayashi, Y. (2020). Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics. Amsterdam: Elsevier. doi:10.1016/j.dam.2019.08.002

    • NLM

      Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2020 ; 281 252-260.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1016/j.dam.2019.08.002

    • Vancouver

      Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2020 ; 281 252-260.[citado 2024 jul. 01 ] Available from: https://doi.org/10.1016/j.dam.2019.08.002

1 - 20 (85 records)

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