ReP USP - Resultado da busca

Filtros : "International Conference on Complex Science - COMPLEX" Limpar

Filtros

Trabalho de evento-anais periodico
Particle competition in complex networks for semi-supervised classification (2009)
Breve, Fabricio; Liang, Zhao; Quiles, Marcos
Source: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecomunications Engineering - LNICST. Conference titles: International Conference on Complex Science - COMPLEX. Unidade: ICMC
Subjects: APRENDIZADO COMPUTACIONAL, REDES COMPLEXAS, RECONHECIMENTO DE PADRÕES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BREVE, Fabricio e LIANG, Zhao e QUILES, Marcos. Particle competition in complex networks for semi-supervised classification. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecomunications Engineering - LNICST. Berlin: Springer. Disponível em: https://doi.org/10.1007/978-3-642-02466-5_14. Acesso em: 12 nov. 2024. , 2009
APA
Breve, F., Liang, Z., & Quiles, M. (2009). Particle competition in complex networks for semi-supervised classification. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecomunications Engineering - LNICST. Berlin: Springer. doi:10.1007/978-3-642-02466-5_14
NLM
Breve F, Liang Z, Quiles M. Particle competition in complex networks for semi-supervised classification [Internet]. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecomunications Engineering - LNICST. 2009 ; 4 163-174.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-642-02466-5_14
Vancouver
Breve F, Liang Z, Quiles M. Particle competition in complex networks for semi-supervised classification [Internet]. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecomunications Engineering - LNICST. 2009 ; 4 163-174.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-642-02466-5_14
Trabalho de evento-anais periodico
Classification based on the optimal K-associated network (2009)
Lopes, Alneu de Andrade ; Bertini Junior, João R.; Motta, Robson; Liang Zhao
Source: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecomunications Engineering - LNICST. Conference titles: International Conference on Complex Science - COMPLEX. Unidade: ICMC
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LOPES, Alneu de Andrade et al. Classification based on the optimal K-associated network. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecomunications Engineering - LNICST. Berlin: Springer. Disponível em: https://doi.org/10.1007/978-3-642-02466-5_117. Acesso em: 12 nov. 2024. , 2009
APA
Lopes, A. de A., Bertini Junior, J. R., Motta, R., & Liang Zhao,. (2009). Classification based on the optimal K-associated network. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecomunications Engineering - LNICST. Berlin: Springer. doi:10.1007/978-3-642-02466-5_117
NLM
Lopes A de A, Bertini Junior JR, Motta R, Liang Zhao. Classification based on the optimal K-associated network [Internet]. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecomunications Engineering - LNICST. 2009 ; 4 1167-1177.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-642-02466-5_117
Vancouver
Lopes A de A, Bertini Junior JR, Motta R, Liang Zhao. Classification based on the optimal K-associated network [Internet]. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecomunications Engineering - LNICST. 2009 ; 4 1167-1177.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-642-02466-5_117

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