Menu

Filtros : "Lecture Notes in Computer Science" "Indexado no Scopus" Removido: "International Conference on Intelligent Data Engineering and Automated Learning" Limpar

Filtros

Refine with date range

  • 1

1 - 6 (6 records)

  • Trabalho de evento-anais periodico

    Multi-objective evolutionary algorithm with node-depth encoding and strength Pareto for service restoration in large-scale distribution systems (2013)

    Gois, Marcilene Moreira; Sanches, Danilo Sipoli; Martins, Jean Paulo; London Junior, João Bosco Augusto ; Delbem, Alexandre Cláudio Botazzo

    Source: Lecture Notes in Computer Science. Conference titles: International Conference on Evolutionary Multi-Criterion Optimization. Unidades: EESC, ICMC

    Subjects: ALGORITMOS, SISTEMAS DISTRIBUÍDOS

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

    • ABNT

      GOIS, Marcilene Moreira et al. Multi-objective evolutionary algorithm with node-depth encoding and strength Pareto for service restoration in large-scale distribution systems. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/978-3-642-37140-0_57. Acesso em: 05 nov. 2025. , 2013

    • APA

      Gois, M. M., Sanches, D. S., Martins, J. P., London Junior, J. B. A., & Delbem, A. C. B. (2013). Multi-objective evolutionary algorithm with node-depth encoding and strength Pareto for service restoration in large-scale distribution systems. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. doi:10.1007/978-3-642-37140-0_57

    • NLM

      Gois MM, Sanches DS, Martins JP, London Junior JBA, Delbem ACB. Multi-objective evolutionary algorithm with node-depth encoding and strength Pareto for service restoration in large-scale distribution systems [Internet]. Lecture Notes in Computer Science. 2013 ; 7811 771-786.[citado 2025 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-37140-0_57

    • Vancouver

      Gois MM, Sanches DS, Martins JP, London Junior JBA, Delbem ACB. Multi-objective evolutionary algorithm with node-depth encoding and strength Pareto for service restoration in large-scale distribution systems [Internet]. Lecture Notes in Computer Science. 2013 ; 7811 771-786.[citado 2025 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-37140-0_57

  • Trabalho de evento-anais periodico

    On the application of bio-inspired algorithms in timetabling problem (2012)

    Francisco, Daniela Oliveira; Silva, Ivan Nunes da

    Source: Lecture Notes in Computer Science. Conference titles: International Conference on Neural Information Processing - ICONIP. Unidade: EESC

    Subjects: SISTEMAS IMUNOLÓGICOS ARTIFICIAIS, ALGORITMOS GENÉTICOS

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

    • ABNT

      FRANCISCO, Daniela Oliveira e SILVA, Ivan Nunes da. On the application of bio-inspired algorithms in timetabling problem. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/978-3-642-34487-9_77. Acesso em: 05 nov. 2025. , 2012

    • APA

      Francisco, D. O., & Silva, I. N. da. (2012). On the application of bio-inspired algorithms in timetabling problem. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. doi:10.1007/978-3-642-34487-9_77

    • NLM

      Francisco DO, Silva IN da. On the application of bio-inspired algorithms in timetabling problem [Internet]. Lecture Notes in Computer Science. 2012 ; 7665 637-644.[citado 2025 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-34487-9_77

    • Vancouver

      Francisco DO, Silva IN da. On the application of bio-inspired algorithms in timetabling problem [Internet]. Lecture Notes in Computer Science. 2012 ; 7665 637-644.[citado 2025 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-34487-9_77

  • Trabalho de evento-anais periodico

    Neurogenetic approach for solving dynamic programming problems (2010)

    Pires, Matheus Giovanni; Silva, Ivan Nunes da

    Source: Lecture Notes in Computer Science. Conference titles: International Conference on Artifical Intelligence and Soft Computing. Unidade: EESC

    Subjects: ALGORITMOS GENÉTICOS, PROGRAMAÇÃO DINÂMICA

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

    • ABNT

      PIRES, Matheus Giovanni e SILVA, Ivan Nunes da. Neurogenetic approach for solving dynamic programming problems. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/978-3-642-13232-2_10. Acesso em: 05 nov. 2025. , 2010

    • APA

      Pires, M. G., & Silva, I. N. da. (2010). Neurogenetic approach for solving dynamic programming problems. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. doi:10.1007/978-3-642-13232-2_10

    • NLM

      Pires MG, Silva IN da. Neurogenetic approach for solving dynamic programming problems [Internet]. Lecture Notes in Computer Science. 2010 ; 6114 72-79.[citado 2025 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-13232-2_10

    • Vancouver

      Pires MG, Silva IN da. Neurogenetic approach for solving dynamic programming problems [Internet]. Lecture Notes in Computer Science. 2010 ; 6114 72-79.[citado 2025 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-13232-2_10

  • Trabalho de evento-anais periodico

    Hybrid Hopfield architecture for solving nonlinear programming problems (2009)

    Bertoni, Fabiana Cristina; Silva, Ivan Nunes da

    Source: Lecture Notes in Computer Science. Conference titles: International Conference on Neural Information Processing. Unidade: EESC

    Subjects: ALGORITMOS GENÉTICOS, PROGRAMAÇÃO NÃO LINEAR

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

    • ABNT

      BERTONI, Fabiana Cristina e SILVA, Ivan Nunes da. Hybrid Hopfield architecture for solving nonlinear programming problems. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/978-3-642-10677-4_30. Acesso em: 05 nov. 2025. , 2009

    • APA

      Bertoni, F. C., & Silva, I. N. da. (2009). Hybrid Hopfield architecture for solving nonlinear programming problems. Lecture Notes in Computer Science. Heidelberg: Escola de Engenharia de São Carlos, Universidade de São Paulo. doi:10.1007/978-3-642-10677-4_30

    • NLM

      Bertoni FC, Silva IN da. Hybrid Hopfield architecture for solving nonlinear programming problems [Internet]. Lecture Notes in Computer Science. 2009 ; 5863 267-276.[citado 2025 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-10677-4_30

    • Vancouver

      Bertoni FC, Silva IN da. Hybrid Hopfield architecture for solving nonlinear programming problems [Internet]. Lecture Notes in Computer Science. 2009 ; 5863 267-276.[citado 2025 nov. 05 ] Available from: https://doi.org/10.1007/978-3-642-10677-4_30

  • Trabalho de evento-anais periodico

    Generating checking sequences for partial finite state machines (2008)

    Simão, Adenilso da Silva ; Petrenko, Alexandre

    Source: Lecture Notes in Computer Science. Conference titles: International Conference, TestCom 2008 - IFIP TC6/WG 6.1. Unidade: ICMC

    Subjects: ENGENHARIA DE SOFTWARE, SISTEMAS DE INFORMAÇÃO

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

    • ABNT

      SIMÃO, Adenilso da Silva e PETRENKO, Alexandre. Generating checking sequences for partial finite state machines. Lecture Notes in Computer Science. Berlin: Springer. Disponível em: http://www.springerlink.com/content/l8157t457k771104/?p=157bb5eb09034a56882498aea060ecea&pi=0. Acesso em: 05 nov. 2025. , 2008

    • APA

      Simão, A. da S., & Petrenko, A. (2008). Generating checking sequences for partial finite state machines. Lecture Notes in Computer Science. Berlin: Springer. Recuperado de http://www.springerlink.com/content/l8157t457k771104/?p=157bb5eb09034a56882498aea060ecea&pi=0

    • NLM

      Simão A da S, Petrenko A. Generating checking sequences for partial finite state machines [Internet]. Lecture Notes in Computer Science. 2008 ; 5047 153-168.[citado 2025 nov. 05 ] Available from: http://www.springerlink.com/content/l8157t457k771104/?p=157bb5eb09034a56882498aea060ecea&pi=0

    • Vancouver

      Simão A da S, Petrenko A. Generating checking sequences for partial finite state machines [Internet]. Lecture Notes in Computer Science. 2008 ; 5047 153-168.[citado 2025 nov. 05 ] Available from: http://www.springerlink.com/content/l8157t457k771104/?p=157bb5eb09034a56882498aea060ecea&pi=0

  • Trabalho de evento-anais periodico

    A new approach for optimization of dynamic metric access methods using an algorithm of effective deletion (2008)

    Bueno, Renato; Kaster, Daniel dos Santos; Traina, Agma Juci Machado ; Traina Junior, Caetano

    Source: Lecture Notes in Computer Science. Conference titles: International Conference - SSDBM 2008. Unidade: ICMC

    Subjects: COMPUTAÇÃO GRÁFICA, PROCESSAMENTO DE IMAGENS

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

    • ABNT

      BUENO, Renato et al. A new approach for optimization of dynamic metric access methods using an algorithm of effective deletion. Lecture Notes in Computer Science. Heidelberg: Springer. Disponível em: http://www.springerlink.com/content/3r30576132t0mm75/fulltext.pdf. Acesso em: 05 nov. 2025. , 2008

    • APA

      Bueno, R., Kaster, D. dos S., Traina, A. J. M., & Traina Junior, C. (2008). A new approach for optimization of dynamic metric access methods using an algorithm of effective deletion. Lecture Notes in Computer Science. Heidelberg: Springer. Recuperado de http://www.springerlink.com/content/3r30576132t0mm75/fulltext.pdf

    • NLM

      Bueno R, Kaster D dos S, Traina AJM, Traina Junior C. A new approach for optimization of dynamic metric access methods using an algorithm of effective deletion [Internet]. Lecture Notes in Computer Science. 2008 ; 5069 366-383.[citado 2025 nov. 05 ] Available from: http://www.springerlink.com/content/3r30576132t0mm75/fulltext.pdf

    • Vancouver

      Bueno R, Kaster D dos S, Traina AJM, Traina Junior C. A new approach for optimization of dynamic metric access methods using an algorithm of effective deletion [Internet]. Lecture Notes in Computer Science. 2008 ; 5069 366-383.[citado 2025 nov. 05 ] Available from: http://www.springerlink.com/content/3r30576132t0mm75/fulltext.pdf
  • 1

1 - 6 (6 records)

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