ReP USP - Resultado da busca

Artigo de periodico
Contour polygonal approximation using the shortest path in networks (2014)
Backes, André Ricardo; Casanova, Dalcimar; Bruno, Odemir Martinez
Source: International Journal of Modern Physics C. Unidade: IFSC
Subjects: REDES COMPLEXAS, REDES DE COMPUTADORES, CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BACKES, André Ricardo e CASANOVA, Dalcimar e BRUNO, Odemir Martinez. Contour polygonal approximation using the shortest path in networks. International Journal of Modern Physics C, v. 25, n. 2, p. 1350090-1-1350090-23, 2014Tradução . . Disponível em: https://doi.org/10.1142/S0129183113500903. Acesso em: 15 ago. 2024.
APA
Backes, A. R., Casanova, D., & Bruno, O. M. (2014). Contour polygonal approximation using the shortest path in networks. International Journal of Modern Physics C, 25( 2), 1350090-1-1350090-23. doi:10.1142/S0129183113500903
NLM
Backes AR, Casanova D, Bruno OM. Contour polygonal approximation using the shortest path in networks [Internet]. International Journal of Modern Physics C. 2014 ; 25( 2): 1350090-1-1350090-23.[citado 2024 ago. 15 ] Available from: https://doi.org/10.1142/S0129183113500903
Vancouver
Backes AR, Casanova D, Bruno OM. Contour polygonal approximation using the shortest path in networks [Internet]. International Journal of Modern Physics C. 2014 ; 25( 2): 1350090-1-1350090-23.[citado 2024 ago. 15 ] Available from: https://doi.org/10.1142/S0129183113500903
Trabalho de evento
Associative learning of a lexicon in a noisy cross-situational scenario (2013)
Tilles, P. F. C.; Fontanari, José Fernando
Source: BIOMAT 2012 : International Symposium on Mathematical and Computational Biology. Conference titles: International Symposium on Mathematical and Computational Biology- BIOMAT. Unidade: IFSC
Subjects: INTELIGÊNCIA ARTIFICIAL, BIOCIÊNCIAS, CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TILLES, P. F. C. e FONTANARI, José Fernando. Associative learning of a lexicon in a noisy cross-situational scenario. 2013, Anais.. Singapura: World Scientific, 2013. Disponível em: https://doi.org/10.1142/9789814520829_0014. Acesso em: 15 ago. 2024.
APA
Tilles, P. F. C., & Fontanari, J. F. (2013). Associative learning of a lexicon in a noisy cross-situational scenario. In BIOMAT 2012 : International Symposium on Mathematical and Computational Biology. Singapura: World Scientific. doi:10.1142/9789814520829_0014
NLM
Tilles PFC, Fontanari JF. Associative learning of a lexicon in a noisy cross-situational scenario [Internet]. BIOMAT 2012 : International Symposium on Mathematical and Computational Biology. 2013 ;[citado 2024 ago. 15 ] Available from: https://doi.org/10.1142/9789814520829_0014
Vancouver
Tilles PFC, Fontanari JF. Associative learning of a lexicon in a noisy cross-situational scenario [Internet]. BIOMAT 2012 : International Symposium on Mathematical and Computational Biology. 2013 ;[citado 2024 ago. 15 ] Available from: https://doi.org/10.1142/9789814520829_0014
Artigo de periodico
Fast, parallel and secure cryptography algorithm using Loren'z attractor (2010)
Marco, Anderson Gonçalves; Martinez, Alexandre Souto; Bruno, Odemir Martinez
Source: International Journal of Modern Physics C. Unidades: FFCLRP, IFSC
Subjects: CAOS (SISTEMAS DINÂMICOS), ATRATORES, DECRIPTOLOGIA, CRIPTOLOGIA, CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARCO, Anderson Gonçalves e MARTINEZ, Alexandre Souto e BRUNO, Odemir Martinez. Fast, parallel and secure cryptography algorithm using Loren'z attractor. International Journal of Modern Physics C, v. 21, n. 3, p. 365-382, 2010Tradução . . Disponível em: https://doi.org/10.1142/S0129183110015166. Acesso em: 15 ago. 2024.
APA
Marco, A. G., Martinez, A. S., & Bruno, O. M. (2010). Fast, parallel and secure cryptography algorithm using Loren'z attractor. International Journal of Modern Physics C, 21( 3), 365-382. doi:10.1142/S0129183110015166
NLM
Marco AG, Martinez AS, Bruno OM. Fast, parallel and secure cryptography algorithm using Loren'z attractor [Internet]. International Journal of Modern Physics C. 2010 ; 21( 3): 365-382.[citado 2024 ago. 15 ] Available from: https://doi.org/10.1142/S0129183110015166
Vancouver
Marco AG, Martinez AS, Bruno OM. Fast, parallel and secure cryptography algorithm using Loren'z attractor [Internet]. International Journal of Modern Physics C. 2010 ; 21( 3): 365-382.[citado 2024 ago. 15 ] Available from: https://doi.org/10.1142/S0129183110015166
Artigo de periodico
On the effects of geographical constraints on task execution in complex networks (2008)
Angelis, André Franceschi de; Travieso, Gonzalo; Ruggiero, Carlos Antônio; Costa, Luciano da Fontoura
Source: International Journal of Modern Physics C. Unidade: IFSC
Subjects: CIÊNCIA DA COMPUTAÇÃO, REDES COMPLEXAS, TOPOLOGIA EM COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANGELIS, André Franceschi de et al. On the effects of geographical constraints on task execution in complex networks. International Journal of Modern Physics C, v. 19, n. 6, p. 847-853, 2008Tradução . . Disponível em: https://doi.org/10.1142/S0129183108012546. Acesso em: 15 ago. 2024.
APA
Angelis, A. F. de, Travieso, G., Ruggiero, C. A., & Costa, L. da F. (2008). On the effects of geographical constraints on task execution in complex networks. International Journal of Modern Physics C, 19( 6), 847-853. doi:10.1142/S0129183108012546
NLM
Angelis AF de, Travieso G, Ruggiero CA, Costa L da F. On the effects of geographical constraints on task execution in complex networks [Internet]. International Journal of Modern Physics C. 2008 ; 19( 6): 847-853.[citado 2024 ago. 15 ] Available from: https://doi.org/10.1142/S0129183108012546
Vancouver
Angelis AF de, Travieso G, Ruggiero CA, Costa L da F. On the effects of geographical constraints on task execution in complex networks [Internet]. International Journal of Modern Physics C. 2008 ; 19( 6): 847-853.[citado 2024 ago. 15 ] Available from: https://doi.org/10.1142/S0129183108012546
Artigo de periodico
Surving opinions in sznajd models on complex networks (2005)
Rodrigues, Francisco Aparecido ; Costa, Luciano da Fontoura
Source: International Journal of Modern Physics C. Unidade: IFSC
Subjects: CIÊNCIA DA COMPUTAÇÃO, FÍSICA MATEMÁTICA, TECNOLOGIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RODRIGUES, Francisco Aparecido e COSTA, Luciano da Fontoura. Surving opinions in sznajd models on complex networks. International Journal of Modern Physics C, v. No 2005, n. 11, p. 1785-1792, 2005Tradução . . Acesso em: 15 ago. 2024.
APA
Rodrigues, F. A., & Costa, L. da F. (2005). Surving opinions in sznajd models on complex networks. International Journal of Modern Physics C, No 2005( 11), 1785-1792.
NLM
Rodrigues FA, Costa L da F. Surving opinions in sznajd models on complex networks. International Journal of Modern Physics C. 2005 ; No 2005( 11): 1785-1792.[citado 2024 ago. 15 ]
Vancouver
Rodrigues FA, Costa L da F. Surving opinions in sznajd models on complex networks. International Journal of Modern Physics C. 2005 ; No 2005( 11): 1785-1792.[citado 2024 ago. 15 ]

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Subjects