ReP USP - Resultado da busca

Parte de monografia/livro
Pattern inference under many guises (2003)
Sagot, Marie France; Wakabayashi, Yoshiko
Fonte: Recent advances in algorithms and combinatorics. Unidade: IME
Assunto: ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SAGOT, Marie France e WAKABAYASHI, Yoshiko. Pattern inference under many guises. Recent advances in algorithms and combinatorics. Tradução . New York: Springer, 2003. . Disponível em: https://doi.org/10.1007/0-387-22444-0_8. Acesso em: 18 nov. 2024.
APA
Sagot, M. F., & Wakabayashi, Y. (2003). Pattern inference under many guises. In Recent advances in algorithms and combinatorics. New York: Springer. doi:10.1007/0-387-22444-0_8
NLM
Sagot MF, Wakabayashi Y. Pattern inference under many guises [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 nov. 18 ] Available from: https://doi.org/10.1007/0-387-22444-0_8
Vancouver
Sagot MF, Wakabayashi Y. Pattern inference under many guises [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 nov. 18 ] Available from: https://doi.org/10.1007/0-387-22444-0_8
Artigo de periodico
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (2003)
Calinescu, Gruia; Fernandes, Cristina Gomes ; Reed, Bruce A.
Fonte: Journal of Algorithms. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e REED, Bruce A. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, v. 48, n. 2, p. 333-359, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0196-6774(03)00073-7. Acesso em: 18 nov. 2024.
APA
Calinescu, G., Fernandes, C. G., & Reed, B. A. (2003). Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, 48( 2), 333-359. doi:10.1016/s0196-6774(03)00073-7
NLM
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7
Vancouver
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7
Artigo de periodico
Globally convergent inexact quasi-Newton methods for solving nonlinear systems (2003)
Birgin, Ernesto Julian Goldberg ; Krejic, Natavsa; Martínez, José Mário
Fonte: Numerical Algorithms. Unidade: IME
Assunto: ANÁLISE NUMÉRICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e KREJIC, Natavsa e MARTÍNEZ, José Mário. Globally convergent inexact quasi-Newton methods for solving nonlinear systems. Numerical Algorithms, v. 32, n. 2-4, p. 249-260, 2003Tradução . . Disponível em: https://doi.org/10.1023%2FA%3A1024013824524. Acesso em: 18 nov. 2024.
APA
Birgin, E. J. G., Krejic, N., & Martínez, J. M. (2003). Globally convergent inexact quasi-Newton methods for solving nonlinear systems. Numerical Algorithms, 32( 2-4), 249-260. doi:10.1023%2FA%3A1024013824524
NLM
Birgin EJG, Krejic N, Martínez JM. Globally convergent inexact quasi-Newton methods for solving nonlinear systems [Internet]. Numerical Algorithms. 2003 ; 32( 2-4): 249-260.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1023%2FA%3A1024013824524
Vancouver
Birgin EJG, Krejic N, Martínez JM. Globally convergent inexact quasi-Newton methods for solving nonlinear systems [Internet]. Numerical Algorithms. 2003 ; 32( 2-4): 249-260.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1023%2FA%3A1024013824524

Unidades USP

ReP

Filtros

Autores

Agência de fomento