Filtros : "ROBÓTICA" "Singapura" "ICMC" Removidos: "Indexado no Scielo" "Universidade Federal do Paraná (UFPR)" "IQSC-SQI" "Biometrical Journal" Limpar

Filtros



Refine with date range


  • Source: Journal of Topology and Analysis. Unidade: ICMC

    Subjects: TOPOLOGIA ALGÉBRICA, GRUPOS DE TRANSFORMAÇÃO, ROBÓTICA, CONTROLE (TEORIA DE SISTEMAS E CONTROLE)

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

      CADAVID-AGUILAR, Natalia et al. Effectual topological complexity. Journal of Topology and Analysis, v. 16, p. 53-70, 2024Tradução . . Disponível em: https://doi.org/10.1142/S1793525321500618. Acesso em: 14 nov. 2024.
    • APA

      Cadavid-Aguilar, N., González, J., Gutiérrez, B., & Zapata, C. A. I. (2024). Effectual topological complexity. Journal of Topology and Analysis, 16, 53-70. doi:10.1142/S1793525321500618
    • NLM

      Cadavid-Aguilar N, González J, Gutiérrez B, Zapata CAI. Effectual topological complexity [Internet]. Journal of Topology and Analysis. 2024 ; 16 53-70.[citado 2024 nov. 14 ] Available from: https://doi.org/10.1142/S1793525321500618
    • Vancouver

      Cadavid-Aguilar N, González J, Gutiérrez B, Zapata CAI. Effectual topological complexity [Internet]. Journal of Topology and Analysis. 2024 ; 16 53-70.[citado 2024 nov. 14 ] Available from: https://doi.org/10.1142/S1793525321500618
  • Source: Discrete Mathematics, Algorithms and Applications. Unidade: ICMC

    Subjects: ESPAÇOS FIBRADOS, HOMOTOPIA, ROBÓTICA

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

      ZAPATA, Cesar Augusto Ipanaque e GONZÁLEZ, Jesús. Multitasking collision-free optimal motion planning algorithms in Euclidean spaces. Discrete Mathematics, Algorithms and Applications, v. 12, n. 3, p. 2050040-1-2050040-19, 2020Tradução . . Disponível em: https://doi.org/10.1142/S1793830920500408. Acesso em: 14 nov. 2024.
    • APA

      Zapata, C. A. I., & González, J. (2020). Multitasking collision-free optimal motion planning algorithms in Euclidean spaces. Discrete Mathematics, Algorithms and Applications, 12( 3), 2050040-1-2050040-19. doi:10.1142/S1793830920500408
    • NLM

      Zapata CAI, González J. Multitasking collision-free optimal motion planning algorithms in Euclidean spaces [Internet]. Discrete Mathematics, Algorithms and Applications. 2020 ; 12( 3): 2050040-1-2050040-19.[citado 2024 nov. 14 ] Available from: https://doi.org/10.1142/S1793830920500408
    • Vancouver

      Zapata CAI, González J. Multitasking collision-free optimal motion planning algorithms in Euclidean spaces [Internet]. Discrete Mathematics, Algorithms and Applications. 2020 ; 12( 3): 2050040-1-2050040-19.[citado 2024 nov. 14 ] Available from: https://doi.org/10.1142/S1793830920500408
  • Source: International Journal on Artificial Intelligence Tools. Unidade: ICMC

    Subjects: SISTEMAS EMBUTIDOS, COMPUTAÇÃO EVOLUTIVA, ROBÓTICA, ALGORITMOS, CLASSIFICAÇÃO, JOGOS DE COMPUTADOR

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

      PEREIRA, Leonardo Tortoro e TOLEDO, Claudio Fabiano Motta. Speeding up search-based algorithms for level generation in physics-based puzzle games. International Journal on Artificial Intelligence Tools, v. 26, n. 5, p. 1760019-1-1760019-23, 2017Tradução . . Disponível em: https://doi.org/10.1142/S0218213017600193. Acesso em: 14 nov. 2024.
    • APA

      Pereira, L. T., & Toledo, C. F. M. (2017). Speeding up search-based algorithms for level generation in physics-based puzzle games. International Journal on Artificial Intelligence Tools, 26( 5), 1760019-1-1760019-23. doi:10.1142/S0218213017600193
    • NLM

      Pereira LT, Toledo CFM. Speeding up search-based algorithms for level generation in physics-based puzzle games [Internet]. International Journal on Artificial Intelligence Tools. 2017 ; 26( 5): 1760019-1-1760019-23.[citado 2024 nov. 14 ] Available from: https://doi.org/10.1142/S0218213017600193
    • Vancouver

      Pereira LT, Toledo CFM. Speeding up search-based algorithms for level generation in physics-based puzzle games [Internet]. International Journal on Artificial Intelligence Tools. 2017 ; 26( 5): 1760019-1-1760019-23.[citado 2024 nov. 14 ] Available from: https://doi.org/10.1142/S0218213017600193
  • Source: International Journal on Artificial Intelligence Tools. Unidade: ICMC

    Subjects: COMPUTAÇÃO EVOLUTIVA, ALGORITMOS GENÉTICOS, HEURÍSTICA, ROBÓTICA

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

      ARANTES, Jesimar da Silva et al. Heuristic and genetic algorithm approaches for UAV path planning under critical situation. International Journal on Artificial Intelligence Tools, v. 26, n. 1, p. 1760008-1-1760008-30, 2017Tradução . . Disponível em: https://doi.org/10.1142/S0218213017600089. Acesso em: 14 nov. 2024.
    • APA

      Arantes, J. da S., Arantes, M. da S., Toledo, C. F. M., Trindade Junior, O., & Williams, B. C. (2017). Heuristic and genetic algorithm approaches for UAV path planning under critical situation. International Journal on Artificial Intelligence Tools, 26( 1), 1760008-1-1760008-30. doi:10.1142/S0218213017600089
    • NLM

      Arantes J da S, Arantes M da S, Toledo CFM, Trindade Junior O, Williams BC. Heuristic and genetic algorithm approaches for UAV path planning under critical situation [Internet]. International Journal on Artificial Intelligence Tools. 2017 ; 26( 1): 1760008-1-1760008-30.[citado 2024 nov. 14 ] Available from: https://doi.org/10.1142/S0218213017600089
    • Vancouver

      Arantes J da S, Arantes M da S, Toledo CFM, Trindade Junior O, Williams BC. Heuristic and genetic algorithm approaches for UAV path planning under critical situation [Internet]. International Journal on Artificial Intelligence Tools. 2017 ; 26( 1): 1760008-1-1760008-30.[citado 2024 nov. 14 ] Available from: https://doi.org/10.1142/S0218213017600089

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