Filtros : "Singapura" "ALGORITMOS" Removido: "FORP" Limpar

Filtros



Refine with date range


  • Source: Proceedings. Conference titles: International Symposium Advances in Signal Processing and Intelligent Recognition Systems - SIRS. Unidade: EESC

    Subjects: MÁQUINAS ELÉTRICAS, MOTORES DE INDUÇÃO, APRENDIZADO COMPUTACIONAL, ALGORITMOS

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

      GODOY, Wagner Fontes et al. Intelligent systems applied to the classification of multiple faults in inverter fed induction motors. 2019, Anais.. Singapura: Escola de Engenharia de São Carlos, Universidade de São Paulo, 2019. Disponível em: http://dx.doi.org/10.1007/978-981-13-5758-9_10. Acesso em: 17 ago. 2024.
    • APA

      Godoy, W. F., Goedtel, A., Silva, I. N. da, Palácios, R. H. C., & L’Erario, A. (2019). Intelligent systems applied to the classification of multiple faults in inverter fed induction motors. In Proceedings. Singapura: Escola de Engenharia de São Carlos, Universidade de São Paulo. doi:10.1007/978-981-13-5758-9_10
    • NLM

      Godoy WF, Goedtel A, Silva IN da, Palácios RHC, L’Erario A. Intelligent systems applied to the classification of multiple faults in inverter fed induction motors [Internet]. Proceedings. 2019 ;[citado 2024 ago. 17 ] Available from: http://dx.doi.org/10.1007/978-981-13-5758-9_10
    • Vancouver

      Godoy WF, Goedtel A, Silva IN da, Palácios RHC, L’Erario A. Intelligent systems applied to the classification of multiple faults in inverter fed induction motors [Internet]. Proceedings. 2019 ;[citado 2024 ago. 17 ] Available from: http://dx.doi.org/10.1007/978-981-13-5758-9_10
  • Source: Electric Distribution Network Planning. Unidade: EP

    Subjects: PLANEJAMENTO ENERGÉTICO, DISTRIBUIÇÃO DE ENERGIA ELÉTRICA, ALGORITMOS

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

      ALMEIDA, Carlos Frederico Meschini et al. Optimal allocation of automatic reclosers. Electric Distribution Network Planning. Tradução . Singapura: Springer, 2018. . Disponível em: https://doi.org/10.1007/978-981-10-7056-3_13. Acesso em: 17 ago. 2024.
    • APA

      Almeida, C. F. M., Quiroga, G. A., Kagan, H., & Kagan, N. (2018). Optimal allocation of automatic reclosers. In Electric Distribution Network Planning. Singapura: Springer. doi:10.1007/978-981-10-7056-3_13
    • NLM

      Almeida CFM, Quiroga GA, Kagan H, Kagan N. Optimal allocation of automatic reclosers [Internet]. In: Electric Distribution Network Planning. Singapura: Springer; 2018. [citado 2024 ago. 17 ] Available from: https://doi.org/10.1007/978-981-10-7056-3_13
    • Vancouver

      Almeida CFM, Quiroga GA, Kagan H, Kagan N. Optimal allocation of automatic reclosers [Internet]. In: Electric Distribution Network Planning. Singapura: Springer; 2018. [citado 2024 ago. 17 ] Available from: https://doi.org/10.1007/978-981-10-7056-3_13
  • 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: 17 ago. 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 ago. 17 ] 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 ago. 17 ] Available from: https://doi.org/10.1142/S0218213017600193
  • Source: International Journal of Foundations of Computer Science. Conference titles: Workshop on Advances in Parallel and Distributed Computational Models - APDCM. Unidade: IME

    Assunto: ALGORITMOS

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

      BOUGERET, Marin et al. Approximating the discrete resource sharing scheduling problem. International Journal of Foundations of Computer Science. Singapore: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1142/S0129054111008271. Acesso em: 17 ago. 2024. , 2011
    • APA

      Bougeret, M., Dutot, P. -F., Goldman, A., Ngoko, Y., & Trystram, D. (2011). Approximating the discrete resource sharing scheduling problem. International Journal of Foundations of Computer Science. Singapore: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1142/S0129054111008271
    • NLM

      Bougeret M, Dutot P-F, Goldman A, Ngoko Y, Trystram D. Approximating the discrete resource sharing scheduling problem [Internet]. International Journal of Foundations of Computer Science. 2011 ; 22( 3): 639-656.[citado 2024 ago. 17 ] Available from: https://doi.org/10.1142/S0129054111008271
    • Vancouver

      Bougeret M, Dutot P-F, Goldman A, Ngoko Y, Trystram D. Approximating the discrete resource sharing scheduling problem [Internet]. International Journal of Foundations of Computer Science. 2011 ; 22( 3): 639-656.[citado 2024 ago. 17 ] Available from: https://doi.org/10.1142/S0129054111008271
  • Source: International Journal of Trade, Economics and Finance. Unidade: EP

    Subjects: ENGENHARIA ELÉTRICA, MERCADO FINANCEIRO, ALGORITMOS

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

      AGUIAR, Renato Aparecido e SALES, Roberto Moura. Overreact analysis in the american stock market: a Fuzzy C-means algorithm approach. International Journal of Trade, Economics and Finance, v. 1, n. 4, p. 325-330, 2010Tradução . . Disponível em: http://www.ijtef.org/papers/58-F157.pdf. Acesso em: 17 ago. 2024.
    • APA

      Aguiar, R. A., & Sales, R. M. (2010). Overreact analysis in the american stock market: a Fuzzy C-means algorithm approach. International Journal of Trade, Economics and Finance, 1( 4), 325-330. Recuperado de http://www.ijtef.org/papers/58-F157.pdf
    • NLM

      Aguiar RA, Sales RM. Overreact analysis in the american stock market: a Fuzzy C-means algorithm approach [Internet]. International Journal of Trade, Economics and Finance. 2010 ;1( 4): 325-330.[citado 2024 ago. 17 ] Available from: http://www.ijtef.org/papers/58-F157.pdf
    • Vancouver

      Aguiar RA, Sales RM. Overreact analysis in the american stock market: a Fuzzy C-means algorithm approach [Internet]. International Journal of Trade, Economics and Finance. 2010 ;1( 4): 325-330.[citado 2024 ago. 17 ] Available from: http://www.ijtef.org/papers/58-F157.pdf
  • Conference titles: IEEE Congress on Evolutionary Computation. Unidade: FFCLRP

    Subjects: COMPUTAÇÃO EVOLUTIVA, ALGORITMOS, INTELIGÊNCIA ARTIFICIAL

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

      TINÓS, Renato e YANG, Shengxiang. Continuous dynamic problem generators for evolutionary algorithms. 2007, Anais.. Singapore: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo, 2007. . Acesso em: 17 ago. 2024.
    • APA

      Tinós, R., & Yang, S. (2007). Continuous dynamic problem generators for evolutionary algorithms. In . Singapore: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo.
    • NLM

      Tinós R, Yang S. Continuous dynamic problem generators for evolutionary algorithms. 2007 ;[citado 2024 ago. 17 ]
    • Vancouver

      Tinós R, Yang S. Continuous dynamic problem generators for evolutionary algorithms. 2007 ;[citado 2024 ago. 17 ]
  • Source: International Journal of Modern Physics C. Unidade: IFSC

    Subjects: ALGORITMOS, BIODIVERSIDADE, EVOLUÇÃO

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

      ONODY, Roberto Nicolau e CASTRO, Paulo A. Self-organized criticality, optimization and biodiversity. International Journal of Modern Physics C, v. 14, n. 7, p. Se 2003, 2003Tradução . . Acesso em: 17 ago. 2024.
    • APA

      Onody, R. N., & Castro, P. A. (2003). Self-organized criticality, optimization and biodiversity. International Journal of Modern Physics C, 14( 7), Se 2003.
    • NLM

      Onody RN, Castro PA. Self-organized criticality, optimization and biodiversity. International Journal of Modern Physics C. 2003 ; 14( 7): Se 2003.[citado 2024 ago. 17 ]
    • Vancouver

      Onody RN, Castro PA. Self-organized criticality, optimization and biodiversity. International Journal of Modern Physics C. 2003 ; 14( 7): Se 2003.[citado 2024 ago. 17 ]

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