ReP USP - Resultado da busca

Trabalho de evento
Linking Łukasiewicz logic and boolean maximum satisfiability (2023)
Preto, Sandro ; Manyà, Felip ; Finger, Marcelo
Source: Proceedings. Conference titles: International Symposium on Multiple-Valued Logic - ISMVL. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PRETO, Sandro e MANYÀ, Felip e FINGER, Marcelo. Linking Łukasiewicz logic and boolean maximum satisfiability. 2023, Anais.. Piscataway: IEEE, 2023. Disponível em: https://doi.org/10.1109/ISMVL57333.2023.00040. Acesso em: 15 nov. 2024.
APA
Preto, S., Manyà, F., & Finger, M. (2023). Linking Łukasiewicz logic and boolean maximum satisfiability. In Proceedings. Piscataway: IEEE. doi:10.1109/ISMVL57333.2023.00040
NLM
Preto S, Manyà F, Finger M. Linking Łukasiewicz logic and boolean maximum satisfiability [Internet]. Proceedings. 2023 ;[citado 2024 nov. 15 ] Available from: https://doi.org/10.1109/ISMVL57333.2023.00040
Vancouver
Preto S, Manyà F, Finger M. Linking Łukasiewicz logic and boolean maximum satisfiability [Internet]. Proceedings. 2023 ;[citado 2024 nov. 15 ] Available from: https://doi.org/10.1109/ISMVL57333.2023.00040
Artigo de periodico
Balanced connected partitions of graphs: approximation, parameterization and lower bounds (2023)
Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko
Source: Journal of Combinatorial Optimization. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e OTA, Matheus Jun e WAKABAYASHI, Yoshiko. Balanced connected partitions of graphs: approximation, parameterization and lower bounds. Journal of Combinatorial Optimization, v. 45, n. artigo 127, p. 1-27, 2023Tradução . . Disponível em: https://doi.org/10.1007/s10878-023-01058-x. Acesso em: 15 nov. 2024.
APA
Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2023). Balanced connected partitions of graphs: approximation, parameterization and lower bounds. Journal of Combinatorial Optimization, 45( artigo 127), 1-27. doi:10.1007/s10878-023-01058-x
NLM
Moura PFS, Ota MJ, Wakabayashi Y. Balanced connected partitions of graphs: approximation, parameterization and lower bounds [Internet]. Journal of Combinatorial Optimization. 2023 ; 45( artigo 127): 1-27.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1007/s10878-023-01058-x
Vancouver
Moura PFS, Ota MJ, Wakabayashi Y. Balanced connected partitions of graphs: approximation, parameterization and lower bounds [Internet]. Journal of Combinatorial Optimization. 2023 ; 45( artigo 127): 1-27.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1007/s10878-023-01058-x
Artigo de periodico
Techniques and results on approximation algorithms for packing circles (2022)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: São Paulo Journal of Mathematical Sciences. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Techniques and results on approximation algorithms for packing circles. São Paulo Journal of Mathematical Sciences, v. 16, n. 1, p. 585-615, 2022Tradução . . Disponível em: https://doi.org/10.1007/s40863-022-00301-3. Acesso em: 15 nov. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2022). Techniques and results on approximation algorithms for packing circles. São Paulo Journal of Mathematical Sciences, 16( 1), 585-615. doi:10.1007/s40863-022-00301-3
NLM
Miyazawa FK, Wakabayashi Y. Techniques and results on approximation algorithms for packing circles [Internet]. São Paulo Journal of Mathematical Sciences. 2022 ; 16( 1): 585-615.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1007/s40863-022-00301-3
Vancouver
Miyazawa FK, Wakabayashi Y. Techniques and results on approximation algorithms for packing circles [Internet]. São Paulo Journal of Mathematical Sciences. 2022 ; 16( 1): 585-615.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1007/s40863-022-00301-3
Trabalho de evento
Sunflower theorems in monotone circuit complexity (2021)
Cavalar, Bruno Pasqualotto ; Kohayakawa, Yoshiharu
Source: Anais. Conference titles: Congresso da Sociedade Brasileira de Computação - CSBC. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAVALAR, Bruno Pasqualotto e KOHAYAKAWA, Yoshiharu. Sunflower theorems in monotone circuit complexity. 2021, Anais.. Porto Alegre: SBC, 2021. Disponível em: https://doi.org/10.5753/ctd.2021.15761. Acesso em: 15 nov. 2024.
APA
Cavalar, B. P., & Kohayakawa, Y. (2021). Sunflower theorems in monotone circuit complexity. In Anais. Porto Alegre: SBC. doi:10.5753/ctd.2021.15761
NLM
Cavalar BP, Kohayakawa Y. Sunflower theorems in monotone circuit complexity [Internet]. Anais. 2021 ;[citado 2024 nov. 15 ] Available from: https://doi.org/10.5753/ctd.2021.15761
Vancouver
Cavalar BP, Kohayakawa Y. Sunflower theorems in monotone circuit complexity [Internet]. Anais. 2021 ;[citado 2024 nov. 15 ] Available from: https://doi.org/10.5753/ctd.2021.15761
Artigo de periodico
On constrained optimization with nonconvex regularization (2021)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário ; Ramos, Alberto
Source: Numerical Algorithms. Unidade: IME
Subjects: OTIMIZAÇÃO NÃO LINEAR, COMPUTABILIDADE E COMPLEXIDADE
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 e RAMOS, Alberto. On constrained optimization with nonconvex regularization. Numerical Algorithms, v. 86, n. 3, p. 1165-1188, 2021Tradução . . Disponível em: https://doi.org/10.1007/s11075-020-00928-3. Acesso em: 15 nov. 2024.
APA
Birgin, E. J. G., Martínez, J. M., & Ramos, A. (2021). On constrained optimization with nonconvex regularization. Numerical Algorithms, 86( 3), 1165-1188. doi:10.1007/s11075-020-00928-3
NLM
Birgin EJG, Martínez JM, Ramos A. On constrained optimization with nonconvex regularization [Internet]. Numerical Algorithms. 2021 ; 86( 3): 1165-1188.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1007/s11075-020-00928-3
Vancouver
Birgin EJG, Martínez JM, Ramos A. On constrained optimization with nonconvex regularization [Internet]. Numerical Algorithms. 2021 ; 86( 3): 1165-1188.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1007/s11075-020-00928-3
Artigo de periodico
The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (2020)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: International Journal of Approximate Reasoning. Unidades: EP, IME
Subjects: PROGRAMAÇÃO LÓGICA, COMPUTABILIDADE E COMPLEXIDADE
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 joy of probabilistic answer set programming: semantics, complexity, expressivity, inference. International Journal of Approximate Reasoning, v. 125, p. 218-239, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2020.07.004. Acesso em: 15 nov. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2020). The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference. International Journal of Approximate Reasoning, 125, 218-239. doi:10.1016/j.ijar.2020.07.004
NLM
Cozman FG, Mauá DD. The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference [Internet]. International Journal of Approximate Reasoning. 2020 ; 125 218-239.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.004
Vancouver
Cozman FG, Mauá DD. The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference [Internet]. International Journal of Approximate Reasoning. 2020 ; 125 218-239.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.004
Artigo de periodico
Complexity results for probabilistic answer set programming (2020)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: International Journal of Approximate Reasoning. Unidades: IME, EP
Assunto: COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. Complexity results for probabilistic answer set programming. International Journal of Approximate Reasoning, v. 118, p. 133-154, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2019.12.003. Acesso em: 15 nov. 2024.
APA
Mauá, D. D., & Cozman, F. G. (2020). Complexity results for probabilistic answer set programming. International Journal of Approximate Reasoning, 118, 133-154. doi:10.1016/j.ijar.2019.12.003
NLM
Mauá DD, Cozman FG. Complexity results for probabilistic answer set programming [Internet]. International Journal of Approximate Reasoning. 2020 ;118 133-154.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.ijar.2019.12.003
Vancouver
Mauá DD, Cozman FG. Complexity results for probabilistic answer set programming [Internet]. International Journal of Approximate Reasoning. 2020 ;118 133-154.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.ijar.2019.12.003
Trabalho de evento
How micro are your services? (2020)
Rosa, Thatiane de Oliveira ; Goldman, Alfredo ; Guerra, Eduardo Martins
Source: Proceedings. Conference titles: International Conference on Software Architecture Companion - ICSA-C. Unidade: IME
Subjects: ARQUITETURA DE SOFTWARE, BASES DE DADOS, COMPUTABILIDADE E COMPLEXIDADE, ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROSA, Thatiane de Oliveira e GOLDMAN, Alfredo e GUERRA, Eduardo Martins. How micro are your services? 2020, Anais.. Piscataway: IEEE, 2020. Disponível em: https://doi.org/10.1109/ICSA-C50368.2020.00023. Acesso em: 15 nov. 2024.
APA
Rosa, T. de O., Goldman, A., & Guerra, E. M. (2020). How micro are your services? In Proceedings. Piscataway: IEEE. doi:10.1109/ICSA-C50368.2020.00023
NLM
Rosa T de O, Goldman A, Guerra EM. How micro are your services? [Internet]. Proceedings. 2020 ;[citado 2024 nov. 15 ] Available from: https://doi.org/10.1109/ICSA-C50368.2020.00023
Vancouver
Rosa T de O, Goldman A, Guerra EM. How micro are your services? [Internet]. Proceedings. 2020 ;[citado 2024 nov. 15 ] Available from: https://doi.org/10.1109/ICSA-C50368.2020.00023
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: 15 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. 15 ] 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. 15 ] Available from: https://doi.org/10.1007/978-3-319-89441-6_10
Artigo de periodico
The complexity of Bayesian networks specified by propositional and relational languages (2018)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: Artificial Intelligence. Unidades: EP, IME
Subjects: INFERÊNCIA BAYESIANA, COMPUTABILIDADE E COMPLEXIDADE
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 complexity of Bayesian networks specified by propositional and relational languages. Artificial Intelligence, v. 262, p. 96-141, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.artint.2018.06.001. Acesso em: 15 nov. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2018). The complexity of Bayesian networks specified by propositional and relational languages. Artificial Intelligence, 262, 96-141. doi:10.1016/j.artint.2018.06.001
NLM
Cozman FG, Mauá DD. The complexity of Bayesian networks specified by propositional and relational languages [Internet]. Artificial Intelligence. 2018 ; 262 96-141.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.artint.2018.06.001
Vancouver
Cozman FG, Mauá DD. The complexity of Bayesian networks specified by propositional and relational languages [Internet]. Artificial Intelligence. 2018 ; 262 96-141.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.artint.2018.06.001
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: 15 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. 15 ] 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. 15 ] Available from: https://doi.org/10.1137/17M1127107
Trabalho de evento
The finite model theory of bayesian networks: descriptive complexity (2018)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: Proceedings. Conference titles: International Joint Conference on Artificial Intelligence - IJCAI. Unidades: IME, EP
Subjects: COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL, INFERÊNCIA BAYESIANA
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 networks: descriptive complexity. 2018, Anais.. Vienna: IJCAI, 2018. Disponível em: https://doi.org/10.24963/ijcai.2018/727. Acesso em: 15 nov. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2018). The finite model theory of bayesian networks: descriptive complexity. In Proceedings. Vienna: IJCAI. doi:10.24963/ijcai.2018/727
NLM
Cozman FG, Mauá DD. The finite model theory of bayesian networks: descriptive complexity [Internet]. Proceedings. 2018 ;[citado 2024 nov. 15 ] Available from: https://doi.org/10.24963/ijcai.2018/727
Vancouver
Cozman FG, Mauá DD. The finite model theory of bayesian networks: descriptive complexity [Internet]. Proceedings. 2018 ;[citado 2024 nov. 15 ] Available from: https://doi.org/10.24963/ijcai.2018/727
Trabalho de evento-anais periodico
On the uncomputability of partial meet contraction for linear-time temporal logic (2018)
Guerra, Paulo T; Wassermann, Renata
Source: South American Journal of Logic. Conference titles: Brazilian Logic Conference - EBL. Unidade: IME
Subjects: LÓGICA, COMPUTABILIDADE E COMPLEXIDADE, 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. On the uncomputability of partial meet contraction for linear-time temporal logic. South American Journal of Logic. Campinas: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: http://www.sa-logic.org/sajl-v4-i2/07-Guerra-Wassermann-SAJL.pdf. Acesso em: 15 nov. 2024. , 2018
APA
Guerra, P. T., & Wassermann, R. (2018). On the uncomputability of partial meet contraction for linear-time temporal logic. South American Journal of Logic. Campinas: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de http://www.sa-logic.org/sajl-v4-i2/07-Guerra-Wassermann-SAJL.pdf
NLM
Guerra PT, Wassermann R. On the uncomputability of partial meet contraction for linear-time temporal logic [Internet]. South American Journal of Logic. 2018 ; 4( 2): 385-406.[citado 2024 nov. 15 ] Available from: http://www.sa-logic.org/sajl-v4-i2/07-Guerra-Wassermann-SAJL.pdf
Vancouver
Guerra PT, Wassermann R. On the uncomputability of partial meet contraction for linear-time temporal logic [Internet]. South American Journal of Logic. 2018 ; 4( 2): 385-406.[citado 2024 nov. 15 ] Available from: http://www.sa-logic.org/sajl-v4-i2/07-Guerra-Wassermann-SAJL.pdf
Artigo de periodico
Energy-aware mapping and live migration of virtual networks (2017)
Rodriguez, Esteban; Alkmim, Gustavo P; Da fonseca, Nelson, L. S; Batista, Daniel Macêdo
Source: IEEE Systems Journal. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, INTERNET, REDE DE TELECOMUNICAÇÕES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RODRIGUEZ, Esteban et al. Energy-aware mapping and live migration of virtual networks. IEEE Systems Journal, v. 11, n. 2, p. 637-648, 2017Tradução . . Disponível em: https://doi.org/10.1109/jsyst.2015.2467159. Acesso em: 15 nov. 2024.
APA
Rodriguez, E., Alkmim, G. P., Da fonseca, N., & Batista, D. M. (2017). Energy-aware mapping and live migration of virtual networks. IEEE Systems Journal, 11( 2), 637-648. doi:10.1109/jsyst.2015.2467159
NLM
Rodriguez E, Alkmim GP, Da fonseca N, Batista DM. Energy-aware mapping and live migration of virtual networks [Internet]. IEEE Systems Journal. 2017 ; 11( 2): 637-648.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1109/jsyst.2015.2467159
Vancouver
Rodriguez E, Alkmim GP, Da fonseca N, Batista DM. Energy-aware mapping and live migration of virtual networks [Internet]. IEEE Systems Journal. 2017 ; 11( 2): 637-648.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1109/jsyst.2015.2467159
Trabalho de evento-resumo
Evaluation complexity for nonlinear constrained optimization using unscaled kkt conditions and highorder models (2016)
Birgin, Ernesto Julian Goldberg
Source: Posters. Conference titles: Brazilian Workshop on Continuous Optimization. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, OTIMIZAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg. Evaluation complexity for nonlinear constrained optimization using unscaled kkt conditions and highorder models. 2016, Anais.. Rio de Janeiro: IMPA, 2016. Disponível em: https://impa.br/wp-content/uploads/2016/12/ernesto_birgin.pdf. Acesso em: 15 nov. 2024.
APA
Birgin, E. J. G. (2016). Evaluation complexity for nonlinear constrained optimization using unscaled kkt conditions and highorder models. In Posters. Rio de Janeiro: IMPA. Recuperado de https://impa.br/wp-content/uploads/2016/12/ernesto_birgin.pdf
NLM
Birgin EJG. Evaluation complexity for nonlinear constrained optimization using unscaled kkt conditions and highorder models [Internet]. Posters. 2016 ;[citado 2024 nov. 15 ] Available from: https://impa.br/wp-content/uploads/2016/12/ernesto_birgin.pdf
Vancouver
Birgin EJG. Evaluation complexity for nonlinear constrained optimization using unscaled kkt conditions and highorder models [Internet]. Posters. 2016 ;[citado 2024 nov. 15 ] Available from: https://impa.br/wp-content/uploads/2016/12/ernesto_birgin.pdf
Trabalho de evento-anais periodico
The structure and complexity of credal semantics (2016)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: CEUR Workshop Proceedings. Conference titles: International Workshop on Probabilistic Logic Programming- PLP. Unidades: EP, IME
Subjects: INTELIGÊNCIA ARTIFICIAL, ANÁLISE MULTIVARIADA, PROGRAMAÇÃO LÓGICA, COMPUTABILIDADE E COMPLEXIDADE
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 structure and complexity of credal semantics. CEUR Workshop Proceedings. Aachen: CEUR Workshop Proceedings. Disponível em: http://ceur-ws.org/Vol-1661/paper-01.pdf. Acesso em: 15 nov. 2024. , 2016
APA
Cozman, F. G., & Mauá, D. D. (2016). The structure and complexity of credal semantics. CEUR Workshop Proceedings. Aachen: CEUR Workshop Proceedings. Recuperado de http://ceur-ws.org/Vol-1661/paper-01.pdf
NLM
Cozman FG, Mauá DD. The structure and complexity of credal semantics [Internet]. CEUR Workshop Proceedings. 2016 ; 1661 3-14.[citado 2024 nov. 15 ] Available from: http://ceur-ws.org/Vol-1661/paper-01.pdf
Vancouver
Cozman FG, Mauá DD. The structure and complexity of credal semantics [Internet]. CEUR Workshop Proceedings. 2016 ; 1661 3-14.[citado 2024 nov. 15 ] Available from: http://ceur-ws.org/Vol-1661/paper-01.pdf
Trabalho de evento
DL-Lite Bayesian networks: a tractable probabilistic graphical model (2015)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. Conference titles: International Conference on Scalable Uncertainty Management - SUM. Unidades: IME, EP
Subjects: MODELOS PARA PROCESSOS ESTOCÁSTICOS, COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL, PROBABILIDADE APLICADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. DL-Lite Bayesian networks: a tractable probabilistic graphical model. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-23540-0_4. Acesso em: 15 nov. 2024.
APA
Mauá, D. D., & Cozman, F. G. (2015). DL-Lite Bayesian networks: a tractable probabilistic graphical model. In Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. Cham: Springer. doi:10.1007/978-3-319-23540-0_4
NLM
Mauá DD, Cozman FG. DL-Lite Bayesian networks: a tractable probabilistic graphical model [Internet]. Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. 2015 ;[citado 2024 nov. 15 ] Available from: https://doi.org/10.1007/978-3-319-23540-0_4
Vancouver
Mauá DD, Cozman FG. DL-Lite Bayesian networks: a tractable probabilistic graphical model [Internet]. Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. 2015 ;[citado 2024 nov. 15 ] Available from: https://doi.org/10.1007/978-3-319-23540-0_4
Trabalho de evento
On the complexity of propositional and relational credal networks (2015)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: Proceedings. Conference titles: International Symposium on Imprecise Probability: Theories and Applications - ISIPTA. Unidades: EP, IME
Subjects: PROBABILIDADE, COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. On the complexity of propositional and relational credal networks. 2015, Anais.. Ariccia: Aracne, 2015. Disponível em: http://sipta.org/isipta15/data/paper/1.pdf. Acesso em: 15 nov. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2015). On the complexity of propositional and relational credal networks. In Proceedings. Ariccia: Aracne. Recuperado de http://sipta.org/isipta15/data/paper/1.pdf
NLM
Cozman FG, Mauá DD. On the complexity of propositional and relational credal networks [Internet]. Proceedings. 2015 ;[citado 2024 nov. 15 ] Available from: http://sipta.org/isipta15/data/paper/1.pdf
Vancouver
Cozman FG, Mauá DD. On the complexity of propositional and relational credal networks [Internet]. Proceedings. 2015 ;[citado 2024 nov. 15 ] Available from: http://sipta.org/isipta15/data/paper/1.pdf
Artigo de periodico
Generalized probabilistic satisfiability through integer programming (2015)
De Bona, Glauber ; Cozman, Fabio Gagliardi ; Finger, Marcelo
Source: Journal of the Brazilian Computer Society. Unidades: EP, IME
Subjects: RACIOCÍNIO PROBABILÍSTICO, COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DE BONA, Glauber e COZMAN, Fabio Gagliardi e FINGER, Marcelo. Generalized probabilistic satisfiability through integer programming. Journal of the Brazilian Computer Society, v. 21, p. 14 , 2015Tradução . . Disponível em: https://doi.org/10.1186/s13173-015-0028-x. Acesso em: 15 nov. 2024.
APA
De Bona, G., Cozman, F. G., & Finger, M. (2015). Generalized probabilistic satisfiability through integer programming. Journal of the Brazilian Computer Society, 21, 14 . doi:10.1186/s13173-015-0028-x
NLM
De Bona G, Cozman FG, Finger M. Generalized probabilistic satisfiability through integer programming [Internet]. Journal of the Brazilian Computer Society. 2015 ; 21 14 .[citado 2024 nov. 15 ] Available from: https://doi.org/10.1186/s13173-015-0028-x
Vancouver
De Bona G, Cozman FG, Finger M. Generalized probabilistic satisfiability through integer programming [Internet]. Journal of the Brazilian Computer Society. 2015 ; 21 14 .[citado 2024 nov. 15 ] Available from: https://doi.org/10.1186/s13173-015-0028-x
Trabalho de evento
Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity (2015)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: Proceedings. Conference titles: AAAI Conference on Artificial Intelligence. Unidades: EP, IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL, PROBABILIDADE APLICADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity. 2015, Anais.. Palo Alto: AAAI Press, 2015. Disponível em: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312. Acesso em: 15 nov. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2015). Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity. In Proceedings. Palo Alto: AAAI Press. Recuperado de http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312
NLM
Cozman FG, Mauá DD. Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity [Internet]. Proceedings. 2015 ;[citado 2024 nov. 15 ] Available from: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312
Vancouver
Cozman FG, Mauá DD. Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity [Internet]. Proceedings. 2015 ;[citado 2024 nov. 15 ] Available from: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312

USP Schools

ReP

Filtros

Document Types

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration