ReP USP - Resultado da busca

Tese (Doutorado)
Synthesizing interpretable strategies for real-time planning in zero-sum games (2021)
Mariño, Julian Ricardo Hernandez; Toledo, Claudio Fabiano Motta (Orientador)
Unidade: ICMC
Subjects: INTELIGÊNCIA ARTIFICIAL, COMPUTAÇÃO EVOLUTIVA, ANÁLISE DE ALGORITMOS, TEMPO-REAL, SÍNTESE DE PROGRAMAS, JOGOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARIÑO, Julian Ricardo Hernandez. Synthesizing interpretable strategies for real-time planning in zero-sum games. 2021. Tese (Doutorado) – Universidade de São Paulo, São Carlos, 2021. Disponível em: https://www.teses.usp.br/teses/disponiveis/55/55134/tde-21122021-111842/. Acesso em: 17 nov. 2024.
APA
Mariño, J. R. H. (2021). Synthesizing interpretable strategies for real-time planning in zero-sum games (Tese (Doutorado). Universidade de São Paulo, São Carlos. Recuperado de https://www.teses.usp.br/teses/disponiveis/55/55134/tde-21122021-111842/
NLM
Mariño JRH. Synthesizing interpretable strategies for real-time planning in zero-sum games [Internet]. 2021 ;[citado 2024 nov. 17 ] Available from: https://www.teses.usp.br/teses/disponiveis/55/55134/tde-21122021-111842/
Vancouver
Mariño JRH. Synthesizing interpretable strategies for real-time planning in zero-sum games [Internet]. 2021 ;[citado 2024 nov. 17 ] Available from: https://www.teses.usp.br/teses/disponiveis/55/55134/tde-21122021-111842/
Artigo de periodico
Complexity and performance of an Augmented Lagrangian algorithm (2020)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário
Source: Optimization Methods and Software. Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] Available from: https://doi.org/10.1080/10556788.2020.1746962
Trabalho de evento-anais periodico
Using adaptive sequences for learning non-resettable FSMs (2019)
Groz, Roland; Bremond, Nicolas; Simão, Adenilso da Silva
Source: Proceedings of Machine Learning Research : PMLR. Conference titles: International Conference on Grammatical Inference - ICGI. Unidade: ICMC
Subjects: ENGENHARIA DE SOFTWARE, ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GROZ, Roland e BREMOND, Nicolas e SIMÃO, Adenilso da Silva. Using adaptive sequences for learning non-resettable FSMs. Proceedings of Machine Learning Research : PMLR. Brookline: Microtome Publishing. Disponível em: http://proceedings.mlr.press/v93/groz19a/groz19a.pdf. Acesso em: 17 nov. 2024. , 2019
APA
Groz, R., Bremond, N., & Simão, A. da S. (2019). Using adaptive sequences for learning non-resettable FSMs. Proceedings of Machine Learning Research : PMLR. Brookline: Microtome Publishing. Recuperado de http://proceedings.mlr.press/v93/groz19a/groz19a.pdf
NLM
Groz R, Bremond N, Simão A da S. Using adaptive sequences for learning non-resettable FSMs [Internet]. Proceedings of Machine Learning Research : PMLR. 2019 ; 93 30-43.[citado 2024 nov. 17 ] Available from: http://proceedings.mlr.press/v93/groz19a/groz19a.pdf
Vancouver
Groz R, Bremond N, Simão A da S. Using adaptive sequences for learning non-resettable FSMs [Internet]. Proceedings of Machine Learning Research : PMLR. 2019 ; 93 30-43.[citado 2024 nov. 17 ] Available from: http://proceedings.mlr.press/v93/groz19a/groz19a.pdf
Artigo de periodico
On regularization and active-set methods with complexity for constrained optimization (2018)
Birgin, Ernesto Julian Goldberg ; Martinez, J M
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] 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
Source: International Journal of Approximate Reasoning. Unidades: IME, EP
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] 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
Source: Proceedings. Conference titles: IEEE International Conference on Services Computing (SCC). Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] 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
Source: Proceedings. Conference titles: IEEE International Conference on Image Processing - ICIP. Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] 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.
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] 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
Source: Journal of Computer and System Sciences. Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] 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
Source: Conceptual Modeling: 34th International Conference, ER 2015, Stockholm, Sweden, October 19-22, 2015, Proceedings. Conference titles: International Conference on Conceptual Modeling - ER. Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] 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
Source: Theoretical Computer Science. Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] 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
Source: Computational Science and Its Applications - ICCSA 2014, 14th International Conference, Guimarães, Portugal, June 30 - July 3, 204, Proceedings, Part I. Conference titles: International Conference on Computational Science and Its Applications. Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] 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
Source: Advances in Neural Information Processing Systems, 27. Conference titles: Annual Conference on Neural Information Processing Systems - NIPS. Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] Available from: http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf
Artigo de periodico
The Efficient Use of Graphic Accelerators to Implement High Accuracy FDTD Algorithms (2014)
Mattes, Leonardo; Kofuji, Sergio Takeo
Source: IEEE Latin America Transactions. Unidade: EP
Subjects: ANÁLISE DE ALGORITMOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MATTES, Leonardo e KOFUJI, Sergio Takeo. The Efficient Use of Graphic Accelerators to Implement High Accuracy FDTD Algorithms. IEEE Latin America Transactions, v. 12, n. 4, p. 825-830, 2014Tradução . . Disponível em: https://doi.org/10.1109/tla.2014.6868889. Acesso em: 17 nov. 2024.
APA
Mattes, L., & Kofuji, S. T. (2014). The Efficient Use of Graphic Accelerators to Implement High Accuracy FDTD Algorithms. IEEE Latin America Transactions, 12( 4), 825-830. doi:10.1109/tla.2014.6868889
NLM
Mattes L, Kofuji ST. The Efficient Use of Graphic Accelerators to Implement High Accuracy FDTD Algorithms [Internet]. IEEE Latin America Transactions. 2014 ; 12( 4): 825-830.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1109/tla.2014.6868889
Vancouver
Mattes L, Kofuji ST. The Efficient Use of Graphic Accelerators to Implement High Accuracy FDTD Algorithms [Internet]. IEEE Latin America Transactions. 2014 ; 12( 4): 825-830.[citado 2024 nov. 17 ] Available from: https://doi.org/10.1109/tla.2014.6868889
Trabalho de evento
Powers of Hamilton cycles in pseudorandom graphs (2014)
Allen, Peter; Bottcher, Julia; Hàn, Hiêp; Kohayakawa, Yoshiharu ; Person, Yury
Source: LATIN 2014: theoretical informatics: Proceedings. Conference titles: Latin American on Theoretical Informatics Symposium - LATIN 2014. Unidade: IME
Subjects: ANÁLISE DE ALGORITMOS, COMPUTABILIDADE E COMPLEXIDADE, MATEMÁTICA DISCRETA, ESTRUTURAS DE DADOS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Powers of Hamilton cycles in pseudorandom graphs. 2014, Anais.. Heidelberg: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-642-54423-1_31. Acesso em: 17 nov. 2024.
APA
Allen, P., Bottcher, J., Hàn, H., Kohayakawa, Y., & Person, Y. (2014). Powers of Hamilton cycles in pseudorandom graphs. In LATIN 2014: theoretical informatics: Proceedings. Heidelberg: Springer. doi:10.1007/978-3-642-54423-1_31
NLM
Allen P, Bottcher J, Hàn H, Kohayakawa Y, Person Y. Powers of Hamilton cycles in pseudorandom graphs [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_31
Vancouver
Allen P, Bottcher J, Hàn H, Kohayakawa Y, Person Y. Powers of Hamilton cycles in pseudorandom graphs [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_31
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
Source: Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings. Conference titles: European Symposium on Algorithms - ESA. Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] Available from: https://doi.org/10.1007/978-3-662-44777-2_59
Tese (Doutorado)
Algoritmos eficientes para equalização autodidata de sinais QAM (2011)
Mendes Filho, João; Silva, Magno Teófilo Madeira da (Orientador)
Unidade: EP
Subjects: FILTROS ELÉTRICOS ADAPTATIVOS, ALGORITMOS, ANÁLISE DE ALGORITMOS, EQUALIZAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MENDES FILHO, João. Algoritmos eficientes para equalização autodidata de sinais QAM. 2011. Tese (Doutorado) – Universidade de São Paulo, São Paulo, 2011. Disponível em: http://www.teses.usp.br/teses/disponiveis/3/3142/tde-15032012-122010/. Acesso em: 17 nov. 2024.
APA
Mendes Filho, J. (2011). Algoritmos eficientes para equalização autodidata de sinais QAM (Tese (Doutorado). Universidade de São Paulo, São Paulo. Recuperado de http://www.teses.usp.br/teses/disponiveis/3/3142/tde-15032012-122010/
NLM
Mendes Filho J. Algoritmos eficientes para equalização autodidata de sinais QAM [Internet]. 2011 ;[citado 2024 nov. 17 ] Available from: http://www.teses.usp.br/teses/disponiveis/3/3142/tde-15032012-122010/
Vancouver
Mendes Filho J. Algoritmos eficientes para equalização autodidata de sinais QAM [Internet]. 2011 ;[citado 2024 nov. 17 ] Available from: http://www.teses.usp.br/teses/disponiveis/3/3142/tde-15032012-122010/
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
Source: Proceedings. Conference titles: International Conference on Data Engineering - ICDE 2010. Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] Available from: https://doi.org/10.1109/ICDE.2010.5447883
Dissertação (Mestrado)
Combinação afim de algoritmos adaptativos (2009)
Candido, Renato ; Silva, Magno Teófilo Madeira da (Orientador)
Unidade: EP
Subjects: FILTROS ELÉTRICOS ADAPTATIVOS, ALGORITMOS (COMBINAÇÃO), ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CANDIDO, Renato. Combinação afim de algoritmos adaptativos. 2009. Dissertação (Mestrado) – Universidade de São Paulo, São Paulo, 2009. Disponível em: http://www.teses.usp.br/teses/disponiveis/3/3142/tde-29062009-113546/. Acesso em: 17 nov. 2024.
APA
Candido, R. (2009). Combinação afim de algoritmos adaptativos (Dissertação (Mestrado). Universidade de São Paulo, São Paulo. Recuperado de http://www.teses.usp.br/teses/disponiveis/3/3142/tde-29062009-113546/
NLM
Candido R. Combinação afim de algoritmos adaptativos [Internet]. 2009 ;[citado 2024 nov. 17 ] Available from: http://www.teses.usp.br/teses/disponiveis/3/3142/tde-29062009-113546/
Vancouver
Candido R. Combinação afim de algoritmos adaptativos [Internet]. 2009 ;[citado 2024 nov. 17 ] Available from: http://www.teses.usp.br/teses/disponiveis/3/3142/tde-29062009-113546/
Trabalho de evento
Jump-miss binary erosion algorithm (2009)
Machado, Anderson Fraiha; Hashimoto, Ronaldo Fumio
Source: Proceedings. Conference titles: Brazilian Symposium on Computer Graphics and Image Processing - SIBGRAPI. Unidade: IME
Subjects: 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] Available from: https://doi.org/10.1109/SIBGRAPI.2009.27

USP Schools

ReP

Filtros

Document Types

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration