Filtros : "Grã-Bretanha (Reino Unido, UK)" "FFCLRP-595" Removido: "Reino Unido" Limpar

Filtros



Refine with date range


  • Source: Machine Learning. Unidade: FFCLRP

    Subjects: REDES COMPLEXAS, REDES NEURAIS, SISTEMAS DINÂMICOS

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

      OLIVEIRA JUNIOR, Laercio de e STELZER, Florian e LIANG, Zhao. Clustered and deep echo state networks for signal noise reduction. Machine Learning, v. 111, n. 8, p. 2885-2904, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10994-022-06135-6. Acesso em: 24 ago. 2024.
    • APA

      Oliveira Junior, L. de, Stelzer, F., & Liang, Z. (2022). Clustered and deep echo state networks for signal noise reduction. Machine Learning, 111( 8), 2885-2904. doi:10.1007/s10994-022-06135-6
    • NLM

      Oliveira Junior L de, Stelzer F, Liang Z. Clustered and deep echo state networks for signal noise reduction [Internet]. Machine Learning. 2022 ; 111( 8): 2885-2904.[citado 2024 ago. 24 ] Available from: https://doi.org/10.1007/s10994-022-06135-6
    • Vancouver

      Oliveira Junior L de, Stelzer F, Liang Z. Clustered and deep echo state networks for signal noise reduction [Internet]. Machine Learning. 2022 ; 111( 8): 2885-2904.[citado 2024 ago. 24 ] Available from: https://doi.org/10.1007/s10994-022-06135-6
  • Source: Proceedings GECCO '21. Conference titles: Genetic and Evolutionary Computation Conference - GECCO '21. Unidade: FFCLRP

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DA COMPUTAÇÃO, OPERADORES

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

      TINÓS, Renato et al. Partition crossover for continuous optimization: ePX. Proceedings GECCO '21. New York: ACM. Disponível em: https://doi.org/10.1145/3449639.3459296. Acesso em: 24 ago. 2024. , 2021
    • APA

      Tinós, R., Whitley, D., Chicano, F., & Ochoa, G. (2021). Partition crossover for continuous optimization: ePX. Proceedings GECCO '21. New York: ACM. doi:10.1145/3449639.3459296
    • NLM

      Tinós R, Whitley D, Chicano F, Ochoa G. Partition crossover for continuous optimization: ePX [Internet]. Proceedings GECCO '21. 2021 ;[citado 2024 ago. 24 ] Available from: https://doi.org/10.1145/3449639.3459296
    • Vancouver

      Tinós R, Whitley D, Chicano F, Ochoa G. Partition crossover for continuous optimization: ePX [Internet]. Proceedings GECCO '21. 2021 ;[citado 2024 ago. 24 ] Available from: https://doi.org/10.1145/3449639.3459296
  • Source: Evolutionary Computation. Unidade: FFCLRP

    Subjects: COMPUTAÇÃO EVOLUTIVA, OTIMIZAÇÃO COMBINATÓRIA

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

      TINÓS, Renato e WHITLEY, Darrell e OCHOA, Gabriela. A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Evolutionary Computation, v. 28, n. 2, p. 255-288, 2020Tradução . . Disponível em: https://doi.org/10.1162/evco_a_00254. Acesso em: 24 ago. 2024.
    • APA

      Tinós, R., Whitley, D., & Ochoa, G. (2020). A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Evolutionary Computation, 28( 2), 255-288. doi:10.1162/evco_a_00254
    • NLM

      Tinós R, Whitley D, Ochoa G. A new generalized partition crossover for the traveling salesman problem: tunneling between local optima [Internet]. Evolutionary Computation. 2020 ; 28( 2): 255-288.[citado 2024 ago. 24 ] Available from: https://doi.org/10.1162/evco_a_00254
    • Vancouver

      Tinós R, Whitley D, Ochoa G. A new generalized partition crossover for the traveling salesman problem: tunneling between local optima [Internet]. Evolutionary Computation. 2020 ; 28( 2): 255-288.[citado 2024 ago. 24 ] Available from: https://doi.org/10.1162/evco_a_00254
  • Source: Information Sciences. Unidade: FFCLRP

    Subjects: ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA

    Acesso à fonteDOIHow 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. A framework for inducing artificial changes in optimization problems. Information Sciences, v. 485, p. 486-504, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ins.2019.02.027. Acesso em: 24 ago. 2024.
    • APA

      Tinós, R., & Yang, S. (2019). A framework for inducing artificial changes in optimization problems. Information Sciences, 485, 486-504. doi:10.1016/j.ins.2019.02.027
    • NLM

      Tinós R, Yang S. A framework for inducing artificial changes in optimization problems [Internet]. Information Sciences. 2019 ; 485 486-504.[citado 2024 ago. 24 ] Available from: https://doi.org/10.1016/j.ins.2019.02.027
    • Vancouver

      Tinós R, Yang S. A framework for inducing artificial changes in optimization problems [Internet]. Information Sciences. 2019 ; 485 486-504.[citado 2024 ago. 24 ] Available from: https://doi.org/10.1016/j.ins.2019.02.027
  • Source: Lecture Notes in Computer Science. Conference titles: European Conference on Evolutionary Computation in Combinatorial Optimization - EvoCOP. Unidade: FFCLRP

    Subjects: OPERADORES, CIÊNCIA DA COMPUTAÇÃO, OTIMIZAÇÃO COMBINATÓRIA

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

      CHICANO, Francisco et al. Quasi-optimal recombination operator. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-16711-0_9. Acesso em: 24 ago. 2024. , 2019
    • APA

      Chicano, F., Ochoa, G., Whitley, D., & Tinós, R. (2019). Quasi-optimal recombination operator. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-030-16711-0_9
    • NLM

      Chicano F, Ochoa G, Whitley D, Tinós R. Quasi-optimal recombination operator [Internet]. Lecture Notes in Computer Science. 2019 ; 11452 131-146.[citado 2024 ago. 24 ] Available from: https://doi.org/10.1007/978-3-030-16711-0_9
    • Vancouver

      Chicano F, Ochoa G, Whitley D, Tinós R. Quasi-optimal recombination operator [Internet]. Lecture Notes in Computer Science. 2019 ; 11452 131-146.[citado 2024 ago. 24 ] Available from: https://doi.org/10.1007/978-3-030-16711-0_9
  • Source: Proceedings GECCO '18. Conference titles: The Genetic and Evolutionary Computation Conference (GECCO '18). Unidade: FFCLRP

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, MATEMÁTICA DA COMPUTAÇÃO, CIÊNCIA DA COMPUTAÇÃO

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

      CHICANO, Francisco et al. Enhancing partition crossover with articulation points analysis. Proceedings GECCO '18. New York: ACM. Disponível em: https://riuma.uma.es/xmlui/bitstream/handle/10630/16353/pxap-gecco2018-riuma.pdf?sequence=1&isAllowed=y. Acesso em: 24 ago. 2024. , 2018
    • APA

      Chicano, F., Ochoa, G., Whitley, D., & Tinós, R. (2018). Enhancing partition crossover with articulation points analysis. Proceedings GECCO '18. New York: ACM. Recuperado de https://riuma.uma.es/xmlui/bitstream/handle/10630/16353/pxap-gecco2018-riuma.pdf?sequence=1&isAllowed=y
    • NLM

      Chicano F, Ochoa G, Whitley D, Tinós R. Enhancing partition crossover with articulation points analysis [Internet]. Proceedings GECCO '18. 2018 ;[citado 2024 ago. 24 ] Available from: https://riuma.uma.es/xmlui/bitstream/handle/10630/16353/pxap-gecco2018-riuma.pdf?sequence=1&isAllowed=y
    • Vancouver

      Chicano F, Ochoa G, Whitley D, Tinós R. Enhancing partition crossover with articulation points analysis [Internet]. Proceedings GECCO '18. 2018 ;[citado 2024 ago. 24 ] Available from: https://riuma.uma.es/xmlui/bitstream/handle/10630/16353/pxap-gecco2018-riuma.pdf?sequence=1&isAllowed=y
  • Source: Information Sciences. Unidade: FFCLRP

    Subjects: CÓDIGO GENÉTICO, ALGORITMOS GENÉTICOS

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

      OLIVEIRA, Lariza Laura de e FREITAS, Alex A. e TINÓS, Renato. Multi-objective genetic algorithms in the study of the genetic code’s adaptability. Information Sciences, v. 425, p. 48-61, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.ins.2017.10.022. Acesso em: 24 ago. 2024.
    • APA

      Oliveira, L. L. de, Freitas, A. A., & Tinós, R. (2018). Multi-objective genetic algorithms in the study of the genetic code’s adaptability. Information Sciences, 425, 48-61. doi:10.1016/j.ins.2017.10.022
    • NLM

      Oliveira LL de, Freitas AA, Tinós R. Multi-objective genetic algorithms in the study of the genetic code’s adaptability [Internet]. Information Sciences. 2018 ; 425 48-61.[citado 2024 ago. 24 ] Available from: https://doi.org/10.1016/j.ins.2017.10.022
    • Vancouver

      Oliveira LL de, Freitas AA, Tinós R. Multi-objective genetic algorithms in the study of the genetic code’s adaptability [Internet]. Information Sciences. 2018 ; 425 48-61.[citado 2024 ago. 24 ] Available from: https://doi.org/10.1016/j.ins.2017.10.022
  • Source: Proceedings. Conference titles: Genetic and Evolutionary Computation Conference (GECCO). Unidade: FFCLRP

    Subjects: INTELIGÊNCIA ARTIFICIAL, APRENDIZADO COMPUTACIONAL, HEURÍSTICA

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

      CHICANO, Francisco et al. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. 2017, Anais.. Berlin: ACM, 2017. Disponível em: https://doi.org/10.1145/3071178.3071285. Acesso em: 24 ago. 2024.
    • APA

      Chicano, F., Ochoa, G., Whitley, D., & Tinós, R. (2017). Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In Proceedings. Berlin: ACM. doi:10.1145/3071178.3071285
    • NLM

      Chicano F, Ochoa G, Whitley D, Tinós R. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search [Internet]. Proceedings. 2017 ;[citado 2024 ago. 24 ] Available from: https://doi.org/10.1145/3071178.3071285
    • Vancouver

      Chicano F, Ochoa G, Whitley D, Tinós R. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search [Internet]. Proceedings. 2017 ;[citado 2024 ago. 24 ] Available from: https://doi.org/10.1145/3071178.3071285
  • Source: Proceedings. Conference titles: International Conference on Tools with Artficial Intelligence. Unidade: FFCLRP

    Subjects: APRENDIZADO COMPUTACIONAL, INTELIGÊNCIA ARTIFICIAL

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

      CARNEIRO, Murillo G. et al. Nature-inspired graph optimization for dimensionality reduction. 2017, Anais.. Boston: IEEE, 2017. . Acesso em: 24 ago. 2024.
    • APA

      Carneiro, M. G., Cupertino, T. H., Cheng, R., Jin, Y., & Liang, Z. (2017). Nature-inspired graph optimization for dimensionality reduction. In Proceedings. Boston: IEEE.
    • NLM

      Carneiro MG, Cupertino TH, Cheng R, Jin Y, Liang Z. Nature-inspired graph optimization for dimensionality reduction. Proceedings. 2017 ;[citado 2024 ago. 24 ]
    • Vancouver

      Carneiro MG, Cupertino TH, Cheng R, Jin Y, Liang Z. Nature-inspired graph optimization for dimensionality reduction. Proceedings. 2017 ;[citado 2024 ago. 24 ]
  • Source: Lecture Notes in Computer Science. v. 9921. Unidade: FFCLRP

    Subjects: INTELIGÊNCIA ARTIFICIAL, SOLUÇÃO DE PROBLEMAS

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

      VEERAPEN, Nadarajen et al. Tunneling crossover networks for the asymmetric TSP. Lecture Notes in Computer Science. v. 9921. Tradução . Cham: Springer, 2016. . . Acesso em: 24 ago. 2024.
    • APA

      Veerapen, N., Ochoa, G., Tinós, R., & Whitley, D. (2016). Tunneling crossover networks for the asymmetric TSP. In Lecture Notes in Computer Science. v. 9921. Cham: Springer.
    • NLM

      Veerapen N, Ochoa G, Tinós R, Whitley D. Tunneling crossover networks for the asymmetric TSP. In: Lecture Notes in Computer Science. v. 9921. Cham: Springer; 2016. [citado 2024 ago. 24 ]
    • Vancouver

      Veerapen N, Ochoa G, Tinós R, Whitley D. Tunneling crossover networks for the asymmetric TSP. In: Lecture Notes in Computer Science. v. 9921. Cham: Springer; 2016. [citado 2024 ago. 24 ]
  • Source: Lecture Notes in Computer Science. v. 9921. Unidade: FFCLRP

    Subjects: COMPUTAÇÃO EVOLUTIVA, MEIO AMBIENTE, MUDANÇA

    Acesso à fonteDOIHow 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. Artificially inducing environmental changes in evolutionary dynamic optimization. Lecture Notes in Computer Science. v. 9921. Tradução . Cham: Springer, 2016. . Disponível em: https://doi.org/10.1007/978-3-319-45823-6_21. Acesso em: 24 ago. 2024.
    • APA

      Tinós, R., & Yang, S. (2016). Artificially inducing environmental changes in evolutionary dynamic optimization. In Lecture Notes in Computer Science. v. 9921. Cham: Springer. doi:10.1007/978-3-319-45823-6_21
    • NLM

      Tinós R, Yang S. Artificially inducing environmental changes in evolutionary dynamic optimization [Internet]. In: Lecture Notes in Computer Science. v. 9921. Cham: Springer; 2016. [citado 2024 ago. 24 ] Available from: https://doi.org/10.1007/978-3-319-45823-6_21
    • Vancouver

      Tinós R, Yang S. Artificially inducing environmental changes in evolutionary dynamic optimization [Internet]. In: Lecture Notes in Computer Science. v. 9921. Cham: Springer; 2016. [citado 2024 ago. 24 ] Available from: https://doi.org/10.1007/978-3-319-45823-6_21
  • Source: Annals. Conference titles: IEEE World Congress on Computational Intelligence. Unidade: FFCLRP

    Subjects: INTELIGÊNCIA ARTIFICIAL, REDES COMPLEXAS

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

      CARNEIRO, Murillo G. et al. Network structural optimization based on swarm intelligence for highlevel classification. 2016, Anais.. Vancouver: IEEE, 2016. Disponível em: https://doi.org/10.1109/IJCNN.2016.7727681. Acesso em: 24 ago. 2024.
    • APA

      Carneiro, M. G., Liang, Z., Ran, C., & Jin, Y. (2016). Network structural optimization based on swarm intelligence for highlevel classification. In Annals. Vancouver: IEEE. doi:10.1109/IJCNN.2016.7727681
    • NLM

      Carneiro MG, Liang Z, Ran C, Jin Y. Network structural optimization based on swarm intelligence for highlevel classification [Internet]. Annals. 2016 ;[citado 2024 ago. 24 ] Available from: https://doi.org/10.1109/IJCNN.2016.7727681
    • Vancouver

      Carneiro MG, Liang Z, Ran C, Jin Y. Network structural optimization based on swarm intelligence for highlevel classification [Internet]. Annals. 2016 ;[citado 2024 ago. 24 ] Available from: https://doi.org/10.1109/IJCNN.2016.7727681

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