ReP USP - Resultado da busca

Artigo de periodico
Complexity and performance of an Augmented Lagrangian algorithm (2020)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário
Fonte: Optimization Methods and Software. Unidade: IME
Assuntos: PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA, ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTÍNEZ, José Mário. Complexity and performance of an Augmented Lagrangian algorithm. Optimization Methods and Software, v. 35, n. 5, p. 885-920, 2020Tradução . . Disponível em: https://doi.org/10.1080/10556788.2020.1746962. Acesso em: 06 ago. 2024.
APA
Birgin, E. J. G., & Martínez, J. M. (2020). Complexity and performance of an Augmented Lagrangian algorithm. Optimization Methods and Software, 35( 5), 885-920. doi:10.1080/10556788.2020.1746962
NLM
Birgin EJG, Martínez JM. Complexity and performance of an Augmented Lagrangian algorithm [Internet]. Optimization Methods and Software. 2020 ; 35( 5): 885-920.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1080/10556788.2020.1746962
Vancouver
Birgin EJG, Martínez JM. Complexity and performance of an Augmented Lagrangian algorithm [Internet]. Optimization Methods and Software. 2020 ; 35( 5): 885-920.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1080/10556788.2020.1746962
Artigo de periodico
On regularization and active-set methods with complexity for constrained optimization (2018)
Birgin, Ernesto Julian Goldberg ; Martinez, J M
Fonte: SIAM Journal on Optimization. Unidade: IME
Assuntos: PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA, COMPUTABILIDADE E COMPLEXIDADE, ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTINEZ, J M. On regularization and active-set methods with complexity for constrained optimization. SIAM Journal on Optimization, v. 28, n. 2, p. 1367-1395, 2018Tradução . . Disponível em: https://doi.org/10.1137/17M1127107. Acesso em: 06 ago. 2024.
APA
Birgin, E. J. G., & Martinez, J. M. (2018). On regularization and active-set methods with complexity for constrained optimization. SIAM Journal on Optimization, 28( 2), 1367-1395. doi:10.1137/17M1127107
NLM
Birgin EJG, Martinez JM. On regularization and active-set methods with complexity for constrained optimization [Internet]. SIAM Journal on Optimization. 2018 ; 28( 2): 1367-1395.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1137/17M1127107
Vancouver
Birgin EJG, Martinez JM. On regularization and active-set methods with complexity for constrained optimization [Internet]. SIAM Journal on Optimization. 2018 ; 28( 2): 1367-1395.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1137/17M1127107
Artigo de periodico
The effect of combination functions on the complexity of relational Bayesian networks (2017)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidades: IME, EP
Assuntos: CIÊNCIA DA COMPUTAÇÃO, TEORIA DA COMPUTAÇÃO, ANÁLISE DE ALGORITMOS, ESTATÍSTICA, ANÁLISE MULTIVARIADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. The effect of combination functions on the complexity of relational Bayesian networks. International Journal of Approximate Reasoning, v. 85, p. 178-195, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2017.03.014. Acesso em: 06 ago. 2024.
APA
Mauá, D. D., & Cozman, F. G. (2017). The effect of combination functions on the complexity of relational Bayesian networks. International Journal of Approximate Reasoning, 85, 178-195. doi:10.1016/j.ijar.2017.03.014
NLM
Mauá DD, Cozman FG. The effect of combination functions on the complexity of relational Bayesian networks [Internet]. International Journal of Approximate Reasoning. 2017 ; 85 178-195.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1016/j.ijar.2017.03.014
Vancouver
Mauá DD, Cozman FG. The effect of combination functions on the complexity of relational Bayesian networks [Internet]. International Journal of Approximate Reasoning. 2017 ; 85 178-195.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1016/j.ijar.2017.03.014
Trabalho de evento
Improving the quality of online search services: on the service multi-selection problem (2016)
Ngoko, Yanik; Cerin, Christophe; Goldman, Alfredo
Fonte: Proceedings. Nome do evento: IEEE International Conference on Services Computing (SCC). Unidade: IME
Assuntos: SERVIÇOS, ADMINISTRAÇÃO DA QUALIDADE, COMPUTAÇÃO APLICADA, PROGRAMAÇÃO LINEAR, ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NGOKO, Yanik e CERIN, Christophe e GOLDMAN, Alfredo. Improving the quality of online search services: on the service multi-selection problem. 2016, Anais.. Piscataway: IEEE, 2016. Disponível em: https://doi.org/10.1109/SCC.2016.39. Acesso em: 06 ago. 2024.
APA
Ngoko, Y., Cerin, C., & Goldman, A. (2016). Improving the quality of online search services: on the service multi-selection problem. In Proceedings. Piscataway: IEEE. doi:10.1109/SCC.2016.39
NLM
Ngoko Y, Cerin C, Goldman A. Improving the quality of online search services: on the service multi-selection problem [Internet]. Proceedings. 2016 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1109/SCC.2016.39
Vancouver
Ngoko Y, Cerin C, Goldman A. Improving the quality of online search services: on the service multi-selection problem [Internet]. Proceedings. 2016 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1109/SCC.2016.39
Trabalho de evento
Efficient incremental computation of attributes based on locally countable patterns in component trees (2016)
Silva, Dennis J; Alves, Wonder Alexandre Luz; Morimitsu, Alexandre; Hashimoto, Ronaldo Fumio
Fonte: Proceedings. Nome do evento: IEEE International Conference on Image Processing - ICIP. Unidade: IME
Assuntos: PROCESSAMENTO DE IMAGENS, ALGORITMOS PARA IMAGENS, ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Dennis J et al. Efficient incremental computation of attributes based on locally countable patterns in component trees. 2016, Anais.. Piscataway: IEEE, 2016. Disponível em: https://doi.org/10.1109/icip.2016.7533058. Acesso em: 06 ago. 2024.
APA
Silva, D. J., Alves, W. A. L., Morimitsu, A., & Hashimoto, R. F. (2016). Efficient incremental computation of attributes based on locally countable patterns in component trees. In Proceedings. Piscataway: IEEE. doi:10.1109/icip.2016.7533058
NLM
Silva DJ, Alves WAL, Morimitsu A, Hashimoto RF. Efficient incremental computation of attributes based on locally countable patterns in component trees [Internet]. Proceedings. 2016 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1109/icip.2016.7533058
Vancouver
Silva DJ, Alves WAL, Morimitsu A, Hashimoto RF. Efficient incremental computation of attributes based on locally countable patterns in component trees [Internet]. Proceedings. 2016 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1109/icip.2016.7533058
Artigo de periodico
Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models (2016)
Birgin, Ernesto Julian Goldberg ; Gardenghi, John Lenon Cardoso; Martinez, José Mario; Santos, Sandra A; Toint, Ph. L.
Fonte: SIAM Journal on Optimization. Unidade: IME
Assuntos: PROGRAMAÇÃO NÃO LINEAR, MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO, PROGRAMAÇÃO MATEMÁTICA, ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg et al. Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models. SIAM Journal on Optimization, v. 26, n. 2, p. 951-967, 2016Tradução . . Disponível em: https://doi.org/10.1137/15M1031631. Acesso em: 06 ago. 2024.
APA
Birgin, E. J. G., Gardenghi, J. L. C., Martinez, J. M., Santos, S. A., & Toint, P. L. (2016). Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models. SIAM Journal on Optimization, 26( 2), 951-967. doi:10.1137/15M1031631
NLM
Birgin EJG, Gardenghi JLC, Martinez JM, Santos SA, Toint PL. Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models [Internet]. SIAM Journal on Optimization. 2016 ; 26( 2): 951-967.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1137/15M1031631
Vancouver
Birgin EJG, Gardenghi JLC, Martinez JM, Santos SA, Toint PL. Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models [Internet]. SIAM Journal on Optimization. 2016 ; 26( 2): 951-967.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1137/15M1031631
Artigo de periodico
Geodesic stability for memoryless binary long-lived consensus (2015)
Fernandes, Cristina Gomes ; Stein, Maya
Fonte: Journal of Computer and System Sciences. Unidade: IME
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, ANÁLISE DE ALGORITMOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e STEIN, Maya. Geodesic stability for memoryless binary long-lived consensus. Journal of Computer and System Sciences, v. 81, n. 7, p. 1210–1220, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.jcss.2015.03.002. Acesso em: 06 ago. 2024.
APA
Fernandes, C. G., & Stein, M. (2015). Geodesic stability for memoryless binary long-lived consensus. Journal of Computer and System Sciences, 81( 7), 1210–1220. doi:10.1016/j.jcss.2015.03.002
NLM
Fernandes CG, Stein M. Geodesic stability for memoryless binary long-lived consensus [Internet]. Journal of Computer and System Sciences. 2015 ; 81( 7): 1210–1220.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1016/j.jcss.2015.03.002
Vancouver
Fernandes CG, Stein M. Geodesic stability for memoryless binary long-lived consensus [Internet]. Journal of Computer and System Sciences. 2015 ; 81( 7): 1210–1220.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1016/j.jcss.2015.03.002
Trabalho de evento
Pragmatic requirements for adaptive systems: a goal-driven modeling and analysis approach (2015)
Guimarães, Felipe Pontes; Rodrigues, Genaína Nunes; Batista, Daniel Macêdo ; Ali, Raian
Fonte: Conceptual Modeling: 34th International Conference, ER 2015, Stockholm, Sweden, October 19-22, 2015, Proceedings. Nome do evento: International Conference on Conceptual Modeling - ER. Unidade: IME
Assuntos: GEOMETRIA E MODELAGEM COMPUTACIONAL, ANÁLISE DE ALGORITMOS, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUIMARÃES, Felipe Pontes et al. Pragmatic requirements for adaptive systems: a goal-driven modeling and analysis approach. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-25264-3_4. Acesso em: 06 ago. 2024.
APA
Guimarães, F. P., Rodrigues, G. N., Batista, D. M., & Ali, R. (2015). Pragmatic requirements for adaptive systems: a goal-driven modeling and analysis approach. In Conceptual Modeling: 34th International Conference, ER 2015, Stockholm, Sweden, October 19-22, 2015, Proceedings. Cham: Springer. doi:10.1007/978-3-319-25264-3_4
NLM
Guimarães FP, Rodrigues GN, Batista DM, Ali R. Pragmatic requirements for adaptive systems: a goal-driven modeling and analysis approach [Internet]. Conceptual Modeling: 34th International Conference, ER 2015, Stockholm, Sweden, October 19-22, 2015, Proceedings. 2015 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1007/978-3-319-25264-3_4
Vancouver
Guimarães FP, Rodrigues GN, Batista DM, Ali R. Pragmatic requirements for adaptive systems: a goal-driven modeling and analysis approach [Internet]. Conceptual Modeling: 34th International Conference, ER 2015, Stockholm, Sweden, October 19-22, 2015, Proceedings. 2015 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1007/978-3-319-25264-3_4
Artigo de periodico
Hardness and inapproximability of convex recoloring problems (2014)
Campêlo, Manoel; Huiban, Cristiana Gomes; Sampaio, Rudini Menezes; Wakabayashi, Yoshiko
Fonte: Theoretical Computer Science. Unidade: IME
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS GRAFOS, ANÁLISE DE ALGORITMOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPÊLO, Manoel et al. Hardness and inapproximability of convex recoloring problems. Theoretical Computer Science, v. 533, p. 15-25, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2014.03.017. Acesso em: 06 ago. 2024.
APA
Campêlo, M., Huiban, C. G., Sampaio, R. M., & Wakabayashi, Y. (2014). Hardness and inapproximability of convex recoloring problems. Theoretical Computer Science, 533, 15-25. doi:10.1016/j.tcs.2014.03.017
NLM
Campêlo M, Huiban CG, Sampaio RM, Wakabayashi Y. Hardness and inapproximability of convex recoloring problems [Internet]. Theoretical Computer Science. 2014 ; 533 15-25.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1016/j.tcs.2014.03.017
Vancouver
Campêlo M, Huiban CG, Sampaio RM, Wakabayashi Y. Hardness and inapproximability of convex recoloring problems [Internet]. Theoretical Computer Science. 2014 ; 533 15-25.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1016/j.tcs.2014.03.017
Trabalho de evento
Exercising Java exceptions using Java Pathfinder and program instrumentation (2014)
Martins, Alexandre Locci; Hanazumi, Simone; Melo, Ana Cristina Vieira de
Fonte: Computational Science and Its Applications - ICCSA 2014, 14th International Conference, Guimarães, Portugal, June 30 - July 3, 204, Proceedings, Part I. Nome do evento: International Conference on Computational Science and Its Applications. Unidade: IME
Assuntos: JAVA, INTELIGÊNCIA ARTIFICIAL, ANÁLISE DE ALGORITMOS, QUALIDADE DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARTINS, Alexandre Locci e HANAZUMI, Simone e MELO, Ana Cristina Vieira de. Exercising Java exceptions using Java Pathfinder and program instrumentation. 2014, Anais.. Cham: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-319-09144-0_46. Acesso em: 06 ago. 2024.
APA
Martins, A. L., Hanazumi, S., & Melo, A. C. V. de. (2014). Exercising Java exceptions using Java Pathfinder and program instrumentation. In Computational Science and Its Applications - ICCSA 2014, 14th International Conference, Guimarães, Portugal, June 30 - July 3, 204, Proceedings, Part I. Cham: Springer. doi:10.1007/978-3-319-09144-0_46
NLM
Martins AL, Hanazumi S, Melo ACV de. Exercising Java exceptions using Java Pathfinder and program instrumentation [Internet]. Computational Science and Its Applications - ICCSA 2014, 14th International Conference, Guimarães, Portugal, June 30 - July 3, 204, Proceedings, Part I. 2014 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1007/978-3-319-09144-0_46
Vancouver
Martins AL, Hanazumi S, Melo ACV de. Exercising Java exceptions using Java Pathfinder and program instrumentation [Internet]. Computational Science and Its Applications - ICCSA 2014, 14th International Conference, Guimarães, Portugal, June 30 - July 3, 204, Proceedings, Part I. 2014 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1007/978-3-319-09144-0_46
Trabalho de evento
Advances in learning Bayesian networks of bounded treewidth (2014)
Nie, Siqi; Mauá, Denis Deratani ; Campos, Cassio Polpo de; Ji, Qiang
Fonte: Advances in Neural Information Processing Systems, 27. Nome do evento: Annual Conference on Neural Information Processing Systems - NIPS. Unidade: IME
Assuntos: ALGORITMOS, INTELIGÊNCIA ARTIFICIAL, ANÁLISE DE ALGORITMOS, TEORIA DOS GRAFOS, COMBINATÓRIA, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NIE, Siqi et al. Advances in learning Bayesian networks of bounded treewidth. 2014, Anais.. Montreal: NIPS Foundation, 2014. Disponível em: http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf. Acesso em: 06 ago. 2024.
APA
Nie, S., Mauá, D. D., Campos, C. P. de, & Ji, Q. (2014). Advances in learning Bayesian networks of bounded treewidth. In Advances in Neural Information Processing Systems, 27. Montreal: NIPS Foundation. Recuperado de http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf
NLM
Nie S, Mauá DD, Campos CP de, Ji Q. Advances in learning Bayesian networks of bounded treewidth [Internet]. Advances in Neural Information Processing Systems, 27. 2014 ;[citado 2024 ago. 06 ] Available from: http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf
Vancouver
Nie S, Mauá DD, Campos CP de, Ji Q. Advances in learning Bayesian networks of bounded treewidth [Internet]. Advances in Neural Information Processing Systems, 27. 2014 ;[citado 2024 ago. 06 ] Available from: http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf
Trabalho de evento
Polynomial-time approximation schemes for circle packing problems (2014)
Miyazawa, Flavio Keidi; Pedrosa, Lehilton L. C; Schouery, Rafael Crivellari Saliba; Sviridenko, Maxim; Wakabayashi, Yoshiko
Fonte: Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings. Nome do evento: European Symposium on Algorithms - ESA. Unidade: IME
Assuntos: COMPUTABILIDADE E COMPLEXIDADE, ANÁLISE DE ALGORITMOS, MATEMÁTICA DISCRETA, ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi et al. Polynomial-time approximation schemes for circle packing problems. 2014, Anais.. Berlin: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-662-44777-2_59. Acesso em: 06 ago. 2024.
APA
Miyazawa, F. K., Pedrosa, L. L. C., Schouery, R. C. S., Sviridenko, M., & Wakabayashi, Y. (2014). Polynomial-time approximation schemes for circle packing problems. In Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings. Berlin: Springer. doi:10.1007/978-3-662-44777-2_59
NLM
Miyazawa FK, Pedrosa LLC, Schouery RCS, Sviridenko M, Wakabayashi Y. Polynomial-time approximation schemes for circle packing problems [Internet]. Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings. 2014 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1007/978-3-662-44777-2_59
Vancouver
Miyazawa FK, Pedrosa LLC, Schouery RCS, Sviridenko M, Wakabayashi Y. Polynomial-time approximation schemes for circle packing problems [Internet]. Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings. 2014 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1007/978-3-662-44777-2_59
Trabalho de evento
A partial persistent data structure to support consistency in real-time collaborative editing (2010)
Wu, Qinyi; Pu, Calton; Ferreira, João Eduardo
Fonte: Proceedings. Nome do evento: International Conference on Data Engineering - ICDE 2010. Unidade: IME
Assuntos: ESTRUTURAS DE DADOS, MODELAGEM DE DADOS, AMBIENTE COLABORATIVO, ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
WU, Qinyi e PU, Calton e FERREIRA, João Eduardo. A partial persistent data structure to support consistency in real-time collaborative editing. 2010, Anais.. Los Alamitos: IEEE, 2010. Disponível em: https://doi.org/10.1109/ICDE.2010.5447883. Acesso em: 06 ago. 2024.
APA
Wu, Q., Pu, C., & Ferreira, J. E. (2010). A partial persistent data structure to support consistency in real-time collaborative editing. In Proceedings. Los Alamitos: IEEE. doi:10.1109/ICDE.2010.5447883
NLM
Wu Q, Pu C, Ferreira JE. A partial persistent data structure to support consistency in real-time collaborative editing [Internet]. Proceedings. 2010 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1109/ICDE.2010.5447883
Vancouver
Wu Q, Pu C, Ferreira JE. A partial persistent data structure to support consistency in real-time collaborative editing [Internet]. Proceedings. 2010 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1109/ICDE.2010.5447883
Trabalho de evento
Jump-miss binary erosion algorithm (2009)
Machado, Anderson Fraiha; Hashimoto, Ronaldo Fumio
Fonte: Proceedings. Nome do evento: Brazilian Symposium on Computer Graphics and Image Processing - SIBGRAPI. Unidade: IME
Assuntos: PROCESSAMENTO DE IMAGENS, COMPUTABILIDADE E COMPLEXIDADE, ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MACHADO, Anderson Fraiha e HASHIMOTO, Ronaldo Fumio. Jump-miss binary erosion algorithm. 2009, Anais.. Piscataway: IEEE, 2009. Disponível em: https://doi.org/10.1109/SIBGRAPI.2009.27. Acesso em: 06 ago. 2024.
APA
Machado, A. F., & Hashimoto, R. F. (2009). Jump-miss binary erosion algorithm. In Proceedings. Piscataway: IEEE. doi:10.1109/SIBGRAPI.2009.27
NLM
Machado AF, Hashimoto RF. Jump-miss binary erosion algorithm [Internet]. Proceedings. 2009 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1109/SIBGRAPI.2009.27
Vancouver
Machado AF, Hashimoto RF. Jump-miss binary erosion algorithm [Internet]. Proceedings. 2009 ;[citado 2024 ago. 06 ] Available from: https://doi.org/10.1109/SIBGRAPI.2009.27
Trabalho de evento-anais periodico
An all-substrings common subsequence algorithm (2008)
Alves, C. E. R.; Cáceres, Edson Norberto; Song, Siang Wun
Fonte: Discrete Applied Mathematics. Nome do evento: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Assunto: ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, C. E. R. e CÁCERES, Edson Norberto e SONG, Siang Wun. An all-substrings common subsequence algorithm. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.dam.2007.05.056. Acesso em: 06 ago. 2024. , 2008
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2008). An all-substrings common subsequence algorithm. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2007.05.056
NLM
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 1025-1035.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1016/j.dam.2007.05.056
Vancouver
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 1025-1035.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1016/j.dam.2007.05.056
Trabalho de evento-anais periodico
An all-substrings common subsequence algorithm (2005)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Fonte: Electronic Notes in Discrete Mathematics. Nome do evento: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Assunto: ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2005.05.019. Acesso em: 06 ago. 2024. , 2005
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2005). An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2005.05.019
NLM
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 133-139.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1016/j.endm.2005.05.019
Vancouver
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 133-139.[citado 2024 ago. 06 ] Available from: https://doi.org/10.1016/j.endm.2005.05.019
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: 06 ago. 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 ago. 06 ] 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 ago. 06 ] Available from: https://doi.org/10.1007/0-387-22444-0_8

Unidades USP

ReP

Filtros

Autores

Autores USP

Ano de publicação

Assuntos

Título da fonte

Nome do evento

País de publicação

Agência de fomento

Afiliação dos autores externos não normalizada

País das instituições de afiliação dos autores externos