ReP USP - Resultado da busca

Trabalho de evento
An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph (2024)
Azevedo, Gabriel Morete de ; Wakabayashi, Yoshiko
Source: Anais. Conference titles: Encontro de Teori a da Computação - ETC 2024. Unidade: IME
Subjects: TEORIA DA COMPUTAÇÃO, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
AZEVEDO, Gabriel Morete de e WAKABAYASHI, Yoshiko. An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph. 2024, Anais.. Porto Alegre: Instituto de Matemática e Estatística, Universidade de São Paulo, 2024. Disponível em: https://doi.org/10.5753/etc.2024.2500. Acesso em: 02 nov. 2024.
APA
Azevedo, G. M. de, & Wakabayashi, Y. (2024). An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph. In Anais. Porto Alegre: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.5753/etc.2024.2500
NLM
Azevedo GM de, Wakabayashi Y. An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph [Internet]. Anais. 2024 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.5753/etc.2024.2500
Vancouver
Azevedo GM de, Wakabayashi Y. An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph [Internet]. Anais. 2024 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.5753/etc.2024.2500
Artigo de periodico-carta/editorial
Guest editorial: special issue on theoretical informatics (2023)
Kohayakawa, Yoshiharu ; Miyazawa, Flavio Keidi
Source: Algorithmica. Unidade: IME
Subjects: EDITORIAL, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e MIYAZAWA, Flavio Keidi. Guest editorial: special issue on theoretical informatics. Algorithmica. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/s00453-023-01101-7. Acesso em: 02 nov. 2024. , 2023
APA
Kohayakawa, Y., & Miyazawa, F. K. (2023). Guest editorial: special issue on theoretical informatics. Algorithmica. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1007/s00453-023-01101-7
NLM
Kohayakawa Y, Miyazawa FK. Guest editorial: special issue on theoretical informatics [Internet]. Algorithmica. 2023 ; 85( 8): 2482-2484.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/s00453-023-01101-7
Vancouver
Kohayakawa Y, Miyazawa FK. Guest editorial: special issue on theoretical informatics [Internet]. Algorithmica. 2023 ; 85( 8): 2482-2484.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/s00453-023-01101-7
Artigo de periodico
Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs (2023)
Gómez, Renzo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Theoretical Computer Science. Unidade: IME
Subjects: TEORIA DOS GRAFOS, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs. Theoretical Computer Science, v. 947, n. artigo 113691, p. 1-13, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2023.113691. Acesso em: 02 nov. 2024.
APA
Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2023). Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs. Theoretical Computer Science, 947( artigo 113691), 1-13. doi:10.1016/j.tcs.2023.113691
NLM
Gómez R, Miyazawa FK, Wakabayashi Y. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs [Internet]. Theoretical Computer Science. 2023 ; 947( artigo 113691): 1-13.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1016/j.tcs.2023.113691
Vancouver
Gómez R, Miyazawa FK, Wakabayashi Y. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs [Internet]. Theoretical Computer Science. 2023 ; 947( artigo 113691): 1-13.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1016/j.tcs.2023.113691
Artigo de periodico
A tight lower bound for the online bounded space hypercube bin packing problem (2021)
Kohayakawa, Yoshiharu ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Discrete Mathematics & Theoretical Computer Science. Unidade: IME
Subjects: TEORIA DA COMPUTAÇÃO, ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA, COMBINATÓRIA PROBABILÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. A tight lower bound for the online bounded space hypercube bin packing problem. Discrete Mathematics & Theoretical Computer Science, v. 23, n. 3, p. 1-13, 2021Tradução . . Disponível em: https://doi.org/10.46298/dmtcs.8325. Acesso em: 02 nov. 2024.
APA
Kohayakawa, Y., Miyazawa, F. K., & Wakabayashi, Y. (2021). A tight lower bound for the online bounded space hypercube bin packing problem. Discrete Mathematics & Theoretical Computer Science, 23( 3), 1-13. doi:10.46298/dmtcs.8325
NLM
Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for the online bounded space hypercube bin packing problem [Internet]. Discrete Mathematics & Theoretical Computer Science. 2021 ; 23( 3): 1-13.[citado 2024 nov. 02 ] Available from: https://doi.org/10.46298/dmtcs.8325
Vancouver
Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for the online bounded space hypercube bin packing problem [Internet]. Discrete Mathematics & Theoretical Computer Science. 2021 ; 23( 3): 1-13.[citado 2024 nov. 02 ] Available from: https://doi.org/10.46298/dmtcs.8325
Trabalho de evento-anais periodico
Partition crossover for continuous optimization: ePX (2021)
Tinós, Renato ; Whitley, Darrell; Chicano, Francisco; Ochoa, Gabriela
Source: Proceedings GECCO '21. Conference titles: Genetic and Evolutionary Computation Conference - GECCO '21. Unidade: FFCLRP
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DA COMPUTAÇÃO, OPERADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TINÓS, Renato et al. Partition crossover for continuous optimization: ePX. Proceedings GECCO '21. New York: ACM. Disponível em: https://doi.org/10.1145/3449639.3459296. Acesso em: 02 nov. 2024. , 2021
APA
Tinós, R., Whitley, D., Chicano, F., & Ochoa, G. (2021). Partition crossover for continuous optimization: ePX. Proceedings GECCO '21. New York: ACM. doi:10.1145/3449639.3459296
NLM
Tinós R, Whitley D, Chicano F, Ochoa G. Partition crossover for continuous optimization: ePX [Internet]. Proceedings GECCO '21. 2021 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1145/3449639.3459296
Vancouver
Tinós R, Whitley D, Chicano F, Ochoa G. Partition crossover for continuous optimization: ePX [Internet]. Proceedings GECCO '21. 2021 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1145/3449639.3459296
Trabalho de evento-anais periodico
An efficient implementation of iterative partial transcription for the traveling salesman problem (2021)
Mukhopadhyay, Anirban; Whitley, Darrell; Tinós, Renato
Source: Proceedings GECCO '21. Conference titles: The Genetic and Evolutionary Computation Conference (GECCO '21). Unidade: FFCLRP
Subjects: TABELAS DE CONTINGÊNCIA, ALGORITMOS, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MUKHOPADHYAY, Anirban e WHITLEY, Darrell e TINÓS, Renato. An efficient implementation of iterative partial transcription for the traveling salesman problem. Proceedings GECCO '21. New York: ACM. Disponível em: https://doi.org/10.1145/3449639.3459368. Acesso em: 02 nov. 2024. , 2021
APA
Mukhopadhyay, A., Whitley, D., & Tinós, R. (2021). An efficient implementation of iterative partial transcription for the traveling salesman problem. Proceedings GECCO '21. New York: ACM. doi:10.1145/3449639.3459368
NLM
Mukhopadhyay A, Whitley D, Tinós R. An efficient implementation of iterative partial transcription for the traveling salesman problem [Internet]. Proceedings GECCO '21. 2021 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1145/3449639.3459368
Vancouver
Mukhopadhyay A, Whitley D, Tinós R. An efficient implementation of iterative partial transcription for the traveling salesman problem [Internet]. Proceedings GECCO '21. 2021 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1145/3449639.3459368
Monografia/livro-ed/org
LATIN 2020: theoretical informatics (2020)
Kohayakawa, Yoshiharu (Editor) ; Miyazawa, Flavio Keidi (Editor)
Conference titles: Latin American Symposium - LATIN. Unidade: IME
Subjects: TEORIA DA COMPUTAÇÃO, COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LATIN 2020: theoretical informatics. . Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-61792-9. Acesso em: 02 nov. 2024. , 2020
APA
LATIN 2020: theoretical informatics. (2020). LATIN 2020: theoretical informatics. Cham: Springer. doi:10.1007/978-3-030-61792-9
NLM
LATIN 2020: theoretical informatics [Internet]. 2020 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/978-3-030-61792-9
Vancouver
LATIN 2020: theoretical informatics [Internet]. 2020 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/978-3-030-61792-9
Parte de monografia/livro-apres/pref/posf
We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio] (2020)
Kohayakawa, Yoshiharu (Prefácio) ; Miyazawa, Flavio Keidi (Prefácio)
Source: LATIN 2020 : theoretical informatics. Conference titles: Latin American Symposium - LATIN. Unidade: IME
Subjects: TEORIA DA COMPUTAÇÃO, COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. LATIN 2020 : theoretical informatics. Cham: Springer. Disponível em: https://repositorio.usp.br/directbitstream/b44adcbc-47ff-4f28-bb1e-7df7bf15a8a0/3016802.pdf. Acesso em: 02 nov. 2024. , 2020
APA
We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. (2020). We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. LATIN 2020 : theoretical informatics. Cham: Springer. Recuperado de https://repositorio.usp.br/directbitstream/b44adcbc-47ff-4f28-bb1e-7df7bf15a8a0/3016802.pdf
NLM
We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio] [Internet]. LATIN 2020 : theoretical informatics. 2020 ;[citado 2024 nov. 02 ] Available from: https://repositorio.usp.br/directbitstream/b44adcbc-47ff-4f28-bb1e-7df7bf15a8a0/3016802.pdf
Vancouver
We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio] [Internet]. LATIN 2020 : theoretical informatics. 2020 ;[citado 2024 nov. 02 ] Available from: https://repositorio.usp.br/directbitstream/b44adcbc-47ff-4f28-bb1e-7df7bf15a8a0/3016802.pdf
Artigo de periodico
On some extremal results for order types (2019)
Han, Jie ; Kohayakawa, Yoshiharu ; Sales, Marcelo Tadeu; Stagni, Henrique
Source: Acta Mathematica Universitatis Comenianae. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie et al. On some extremal results for order types. Acta Mathematica Universitatis Comenianae, v. 88, n. 3, p. 779-785, 2019Tradução . . Disponível em: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305. Acesso em: 02 nov. 2024.
APA
Han, J., Kohayakawa, Y., Sales, M. T., & Stagni, H. (2019). On some extremal results for order types. Acta Mathematica Universitatis Comenianae, 88( 3), 779-785. Recuperado de http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305
NLM
Han J, Kohayakawa Y, Sales MT, Stagni H. On some extremal results for order types [Internet]. Acta Mathematica Universitatis Comenianae. 2019 ; 88( 3): 779-785.[citado 2024 nov. 02 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305
Vancouver
Han J, Kohayakawa Y, Sales MT, Stagni H. On some extremal results for order types [Internet]. Acta Mathematica Universitatis Comenianae. 2019 ; 88( 3): 779-785.[citado 2024 nov. 02 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305
Artigo de periodico
The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws (2019)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: International Journal of Approximate Reasoning. Unidades: EP, IME
Subjects: TEORIA DA COMPUTAÇÃO, TEORIA DOS MODELOS, AQUISIÇÃO DE CONHECIMENTO, LÓGICA MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws. International Journal of Approximate Reasoning, v. 110, p. 107-126, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2019.04.003. Acesso em: 02 nov. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2019). The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws. International Journal of Approximate Reasoning, 110, 107-126. doi:10.1016/j.ijar.2019.04.003
NLM
Cozman FG, Mauá DD. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws [Internet]. International Journal of Approximate Reasoning. 2019 ; 110 107-126.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1016/j.ijar.2019.04.003
Vancouver
Cozman FG, Mauá DD. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws [Internet]. International Journal of Approximate Reasoning. 2019 ; 110 107-126.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1016/j.ijar.2019.04.003
Trabalho de evento
Particle competition for multilayer network community detection (2019)
Gao, Xubo; Zheng, Qiusheng; Verri, Filipe Alves Neto ; Rodrigues, Rafael Delalibera ; Liang, Zhao
Source: Proceedings. Conference titles: International Conference on Machine Learning and Computing - ICMLC. Unidades: FFCLRP, ICMC
Subjects: TEORIA DA COMPUTAÇÃO, ALGORITMOS, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GAO, Xubo et al. Particle competition for multilayer network community detection. 2019, Anais.. New York: ACM, 2019. Disponível em: https://doi.org/10.1145/3318299.3318320. Acesso em: 02 nov. 2024.
APA
Gao, X., Zheng, Q., Verri, F. A. N., Rodrigues, R. D., & Liang, Z. (2019). Particle competition for multilayer network community detection. In Proceedings. New York: ACM. doi:10.1145/3318299.3318320
NLM
Gao X, Zheng Q, Verri FAN, Rodrigues RD, Liang Z. Particle competition for multilayer network community detection [Internet]. Proceedings. 2019 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1145/3318299.3318320
Vancouver
Gao X, Zheng Q, Verri FAN, Rodrigues RD, Liang Z. Particle competition for multilayer network community detection [Internet]. Proceedings. 2019 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1145/3318299.3318320
Trabalho de evento
The online multicommodity connected facility location problem (2018)
San Felice, Mário César; Fernandes, Cristina Gomes ; Lintzmayer, Carla Negri
Source: Proceedings. Conference titles: International Workshop on Approximation and Online Algorithms - WAOA. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, COMPUTABILIDADE E COMPLEXIDADE, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SAN FELICE, Mário César e FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri. The online multicommodity connected facility location problem. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-319-89441-6_10. Acesso em: 02 nov. 2024.
APA
San Felice, M. C., Fernandes, C. G., & Lintzmayer, C. N. (2018). The online multicommodity connected facility location problem. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-89441-6_10
NLM
San Felice MC, Fernandes CG, Lintzmayer CN. The online multicommodity connected facility location problem [Internet]. Proceedings. 2018 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/978-3-319-89441-6_10
Vancouver
San Felice MC, Fernandes CG, Lintzmayer CN. The online multicommodity connected facility location problem [Internet]. Proceedings. 2018 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/978-3-319-89441-6_10
Trabalho de evento
A parallel algorithm for minimum spanning tree on GPU (2017)
Vasconcellos, Jucele Franca de Alencar; Caceres, Edson Norberto; Mongelli, Henrique; Song, Siang Wun
Source: Proceedings. Conference titles: International Symposium on Computer Architecture and High Performance Computing Workshops. Unidade: IME
Subjects: TEORIA DA COMPUTAÇÃO, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VASCONCELLOS, Jucele Franca de Alencar et al. A parallel algorithm for minimum spanning tree on GPU. 2017, Anais.. Los Alamitos: IEEE, 2017. Disponível em: https://doi.org/10.1109/SBAC-PADW.2017.20. Acesso em: 02 nov. 2024.
APA
Vasconcellos, J. F. de A., Caceres, E. N., Mongelli, H., & Song, S. W. (2017). A parallel algorithm for minimum spanning tree on GPU. In Proceedings. Los Alamitos: IEEE. doi:10.1109/SBAC-PADW.2017.20
NLM
Vasconcellos JF de A, Caceres EN, Mongelli H, Song SW. A parallel algorithm for minimum spanning tree on GPU [Internet]. Proceedings. 2017 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1109/SBAC-PADW.2017.20
Vancouver
Vasconcellos JF de A, Caceres EN, Mongelli H, Song SW. A parallel algorithm for minimum spanning tree on GPU [Internet]. Proceedings. 2017 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1109/SBAC-PADW.2017.20
Artigo de periodico
The use of quadratic regularization with a cubic descent condition for unconstrained optimization (2017)
Birgin, Ernesto Julian Goldberg ; Martinez, Jose Mario
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO, MÉTODOS NUMÉRICOS, PROGRAMAÇÃO NÃO LINEAR, ANÁLISE NUMÉRICA, CIÊNCIA DA COMPUTAÇÃO, TEORIA DA COMPUTAÇÃO, OTIMIZAÇÃO IRRESTRITA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTINEZ, Jose Mario. The use of quadratic regularization with a cubic descent condition for unconstrained optimization. SIAM Journal on Optimization, v. 27, n. 2, p. 1049-1074, 2017Tradução . . Disponível em: https://doi.org/10.1137/16m110280x. Acesso em: 02 nov. 2024.
APA
Birgin, E. J. G., & Martinez, J. M. (2017). The use of quadratic regularization with a cubic descent condition for unconstrained optimization. SIAM Journal on Optimization, 27( 2), 1049-1074. doi:10.1137/16m110280x
NLM
Birgin EJG, Martinez JM. The use of quadratic regularization with a cubic descent condition for unconstrained optimization [Internet]. SIAM Journal on Optimization. 2017 ; 27( 2): 1049-1074.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1137/16m110280x
Vancouver
Birgin EJG, Martinez JM. The use of quadratic regularization with a cubic descent condition for unconstrained optimization [Internet]. SIAM Journal on Optimization. 2017 ; 27( 2): 1049-1074.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1137/16m110280x
Trabalho de evento
Hitting all longest cycles in a graph (2017)
Fernandes, Cristina Gomes ; Gutierrez, Juan
Source: Anais. Conference titles: Congresso da Sociedade Brasileira de Computação - CSBC. Unidade: IME
Subjects: TEORIA DA COMPUTAÇÃO, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e GUTIERREZ, Juan. Hitting all longest cycles in a graph. 2017, Anais.. São Paulo: Sociedade Brasileira de Computação, 2017. Disponível em: https://doi.org/10.5753/etc.2017.3185. Acesso em: 02 nov. 2024.
APA
Fernandes, C. G., & Gutierrez, J. (2017). Hitting all longest cycles in a graph. In Anais. São Paulo: Sociedade Brasileira de Computação. doi:10.5753/etc.2017.3185
NLM
Fernandes CG, Gutierrez J. Hitting all longest cycles in a graph [Internet]. Anais. 2017 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.5753/etc.2017.3185
Vancouver
Fernandes CG, Gutierrez J. Hitting all longest cycles in a graph [Internet]. Anais. 2017 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.5753/etc.2017.3185
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: 02 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. 02 ] 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. 02 ] Available from: https://doi.org/10.1016/j.ijar.2017.03.014
Trabalho de evento
Towards MC/DC coverage of properties specification patterns (2016)
Melo, Ana Cristina Vieira de; Pasareanu, Corina S; Hanazumi , Simone
Source: Proceedings. Conference titles: International Colloquium on Theoretical Aspects of Computing - ICTAC. Unidade: IME
Subjects: DESENVOLVIMENTO DE SOFTWARE, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MELO, Ana Cristina Vieira de e PASAREANU, Corina S e HANAZUMI , Simone. Towards MC/DC coverage of properties specification patterns. 2016, Anais.. Cham: Springer, 2016. Disponível em: https://doi.org/10.1007/978-3-319-46750-4_10. Acesso em: 02 nov. 2024.
APA
Melo, A. C. V. de, Pasareanu, C. S., & Hanazumi , S. (2016). Towards MC/DC coverage of properties specification patterns. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-46750-4_10
NLM
Melo ACV de, Pasareanu CS, Hanazumi S. Towards MC/DC coverage of properties specification patterns [Internet]. Proceedings. 2016 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/978-3-319-46750-4_10
Vancouver
Melo ACV de, Pasareanu CS, Hanazumi S. Towards MC/DC coverage of properties specification patterns [Internet]. Proceedings. 2016 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/978-3-319-46750-4_10
Trabalho de evento
Belief revision on computation tree logic (2011)
Guerra, Paulo T ; Wassermann, Renata
Source: Proceedings. Conference titles: International Joint Conference on Artificial Intelligence - IJCAI. Unidade: IME
Subjects: TEORIA DA COMPUTAÇÃO, LÓGICA, REVISÃO DE CRENÇAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUERRA, Paulo T e WASSERMANN, Renata. Belief revision on computation tree logic. 2011, Anais.. Palo Alto: AAAI Press, 2011. Disponível em: https://www.ijcai.org/Proceedings/11/Papers/477.pdf. Acesso em: 02 nov. 2024.
APA
Guerra, P. T., & Wassermann, R. (2011). Belief revision on computation tree logic. In Proceedings. Palo Alto: AAAI Press. Recuperado de https://www.ijcai.org/Proceedings/11/Papers/477.pdf
NLM
Guerra PT, Wassermann R. Belief revision on computation tree logic [Internet]. Proceedings. 2011 ;[citado 2024 nov. 02 ] Available from: https://www.ijcai.org/Proceedings/11/Papers/477.pdf
Vancouver
Guerra PT, Wassermann R. Belief revision on computation tree logic [Internet]. Proceedings. 2011 ;[citado 2024 nov. 02 ] Available from: https://www.ijcai.org/Proceedings/11/Papers/477.pdf
Trabalho de evento
An argumentation machinery to reason over inconsistent ontologies (2010)
Moguillansky, Martin O ; Wassermann, Renata ; Falappa, Marcelo A
Source: Proceedings. Conference titles: Ibero-American Conference on Artificial Intelligence - IBERAMIA. Unidade: IME
Subjects: INTELIGÊNCIA ARTIFICIAL, TEORIA DA COMPUTAÇÃO, ONTOLOGIAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOGUILLANSKY, Martin O e WASSERMANN, Renata e FALAPPA, Marcelo A. An argumentation machinery to reason over inconsistent ontologies. 2010, Anais.. Berlin: Springer, 2010. Disponível em: https://doi.org/10.1007/978-3-642-16952-6_11. Acesso em: 02 nov. 2024.
APA
Moguillansky, M. O., Wassermann, R., & Falappa, M. A. (2010). An argumentation machinery to reason over inconsistent ontologies. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-16952-6_11
NLM
Moguillansky MO, Wassermann R, Falappa MA. An argumentation machinery to reason over inconsistent ontologies [Internet]. Proceedings. 2010 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/978-3-642-16952-6_11
Vancouver
Moguillansky MO, Wassermann R, Falappa MA. An argumentation machinery to reason over inconsistent ontologies [Internet]. Proceedings. 2010 ;[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/978-3-642-16952-6_11
Artigo de periodico
Applying semantics to grid middleware (2009)
Vidal, A. C. T.; Silva, F. J. S.; Kofuji, Sergio Takeo ; Kon, Fábio
Source: Concurency and Computation: practice and experience. Unidades: EP, IME
Assunto: TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VIDAL, A. C. T. et al. Applying semantics to grid middleware. Concurency and Computation: practice and experience, v. 21, n. 13, p. 1725-1741, 2009Tradução . . Disponível em: https://doi.org/10.1002/cpe.1395. Acesso em: 02 nov. 2024.
APA
Vidal, A. C. T., Silva, F. J. S., Kofuji, S. T., & Kon, F. (2009). Applying semantics to grid middleware. Concurency and Computation: practice and experience, 21( 13), 1725-1741. doi:10.1002/cpe.1395
NLM
Vidal ACT, Silva FJS, Kofuji ST, Kon F. Applying semantics to grid middleware [Internet]. Concurency and Computation: practice and experience. 2009 ; 21( 13): 1725-1741.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1002/cpe.1395
Vancouver
Vidal ACT, Silva FJS, Kofuji ST, Kon F. Applying semantics to grid middleware [Internet]. Concurency and Computation: practice and experience. 2009 ; 21( 13): 1725-1741.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1002/cpe.1395

USP Schools

ReP

Filtros

Document Types

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Indexado em

Non normalized affiliation

Countries of institutions of collaboration