ReP USP - Resultado da busca

Artigo de periodico-carta/editorial
Special issue on robustness in probabilistic graphical models. [Editorial] (2021)
Mauá, Denis Deratani ; Campos, Cassio Polpo de
Source: International Journal of Approximate Reasoning. Unidade: IME
Assunto: MODELOS PARA PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e CAMPOS, Cassio Polpo de. Special issue on robustness in probabilistic graphical models. [Editorial]. International Journal of Approximate Reasoning. Philadelphia: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.ijar.2021.07.002. Acesso em: 28 maio 2024. , 2021
APA
Mauá, D. D., & Campos, C. P. de. (2021). Special issue on robustness in probabilistic graphical models. [Editorial]. International Journal of Approximate Reasoning. Philadelphia: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.ijar.2021.07.002
NLM
Mauá DD, Campos CP de. Special issue on robustness in probabilistic graphical models. [Editorial] [Internet]. International Journal of Approximate Reasoning. 2021 ; 137 113.[citado 2024 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2021.07.002
Vancouver
Mauá DD, Campos CP de. Special issue on robustness in probabilistic graphical models. [Editorial] [Internet]. International Journal of Approximate Reasoning. 2021 ; 137 113.[citado 2024 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2021.07.002
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: 28 maio 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 maio 28 ] 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 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.004
Trabalho de evento-resumo periodico
Efficient predictive uncertainty estimators for deep probabilistic models (2020)
Llerena, Julissa Villanueva ; Mauá, Denis Deratani
Source: Proceddings : AAAI-20 Student Tracks. Conference titles: AAAI Conference on Artificial Intelligence - AAAI. Unidade: IME
Assunto: MODELOS PARA PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LLERENA, Julissa Villanueva e MAUÁ, Denis Deratani. Efficient predictive uncertainty estimators for deep probabilistic models. Proceddings : AAAI-20 Student Tracks. Palo Alto: AAAI Press. Disponível em: https://doi.org/10.1609/aaai.v34i10.7142. Acesso em: 28 maio 2024. , 2020
APA
Llerena, J. V., & Mauá, D. D. (2020). Efficient predictive uncertainty estimators for deep probabilistic models. Proceddings : AAAI-20 Student Tracks. Palo Alto: AAAI Press. doi:10.1609/aaai.v34i10.7142
NLM
Llerena JV, Mauá DD. Efficient predictive uncertainty estimators for deep probabilistic models [Internet]. Proceddings : AAAI-20 Student Tracks. 2020 ; 35( 100): 13740-13741.[citado 2024 maio 28 ] Available from: https://doi.org/10.1609/aaai.v34i10.7142
Vancouver
Llerena JV, Mauá DD. Efficient predictive uncertainty estimators for deep probabilistic models [Internet]. Proceddings : AAAI-20 Student Tracks. 2020 ; 35( 100): 13740-13741.[citado 2024 maio 28 ] Available from: https://doi.org/10.1609/aaai.v34i10.7142
Trabalho de evento
Finding feasible policies for extreme risk-averse agents in probabilistic planning (2020)
Fernandez, Milton Condori; Barros, Leliane Nunes de ; Mauá, Denis Deratani ; Delgado, Karina Valdivia ; Silva, Valdinei Freire da
Source: Proceedings. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidades: IME, EACH
Subjects: PROBABILIDADE, MODELOS PARA PROCESSOS ESTOCÁSTICOS, ANÁLISE DE RISCO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDEZ, Milton Condori et al. Finding feasible policies for extreme risk-averse agents in probabilistic planning. 2020, Anais.. Cham: Springer, 2020. Disponível em: https://doi.org/10.1007/978-3-030-61380-8_7. Acesso em: 28 maio 2024.
APA
Fernandez, M. C., Barros, L. N. de, Mauá, D. D., Delgado, K. V., & Silva, V. F. da. (2020). Finding feasible policies for extreme risk-averse agents in probabilistic planning. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-61380-8_7
NLM
Fernandez MC, Barros LN de, Mauá DD, Delgado KV, Silva VF da. Finding feasible policies for extreme risk-averse agents in probabilistic planning [Internet]. Proceedings. 2020 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.1007/978-3-030-61380-8_7
Vancouver
Fernandez MC, Barros LN de, Mauá DD, Delgado KV, Silva VF da. Finding feasible policies for extreme risk-averse agents in probabilistic planning [Internet]. Proceedings. 2020 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.1007/978-3-030-61380-8_7
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: 28 maio 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 maio 28 ] 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 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2019.12.003
Artigo de periodico
Thirty years of credal networks: specification, algorithms and complexity (2020)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: International Journal of Approximate Reasoning. Unidades: IME, EP
Subjects: MODELOS PARA PROCESSOS ESTOCÁSTICOS, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. Thirty years of credal networks: specification, algorithms and complexity. International Journal of Approximate Reasoning, v. 126, p. 133-157, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2020.08.009. Acesso em: 28 maio 2024.
APA
Mauá, D. D., & Cozman, F. G. (2020). Thirty years of credal networks: specification, algorithms and complexity. International Journal of Approximate Reasoning, 126, 133-157. doi:10.1016/j.ijar.2020.08.009
NLM
Mauá DD, Cozman FG. Thirty years of credal networks: specification, algorithms and complexity [Internet]. International Journal of Approximate Reasoning. 2020 ; 126 133-157.[citado 2024 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.08.009
Vancouver
Mauá DD, Cozman FG. Thirty years of credal networks: specification, algorithms and complexity [Internet]. International Journal of Approximate Reasoning. 2020 ; 126 133-157.[citado 2024 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.08.009
Artigo de periodico
Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks (2020)
Villanueva Llerena, Julissa ; Mauá, Denis Deratani
Source: International Journal of Approximate Reasoning. Unidade: IME
Subjects: MODELOS PARA PROCESSOS ESTOCÁSTICOS, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VILLANUEVA LLERENA, Julissa e MAUÁ, Denis Deratani. Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks. International Journal of Approximate Reasoning, v. 126, p. 158-180-, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2020.07.008. Acesso em: 28 maio 2024.
APA
Villanueva Llerena, J., & Mauá, D. D. (2020). Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks. International Journal of Approximate Reasoning, 126, 158-180-. doi:10.1016/j.ijar.2020.07.008
NLM
Villanueva Llerena J, Mauá DD. Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks [Internet]. International Journal of Approximate Reasoning. 2020 ; 126 158-180-.[citado 2024 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.008
Vancouver
Villanueva Llerena J, Mauá DD. Efficient algorithms for robustness analysis of maximum a posteriori inference in selective sum-product networks [Internet]. International Journal of Approximate Reasoning. 2020 ; 126 158-180-.[citado 2024 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.008
Trabalho de evento
On the performance of planning through backpropagation (2020)
Scaroni, Renato; Bueno, Thiago Pereira; Barros, Leliane Nunes de ; Mauá, Denis Deratani
Source: Proceedings. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: IME
Subjects: APRENDIZAGEM PROFUNDA, COMPUTAÇÃO APLICADA, METODOLOGIA E TÉCNICAS DE COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SCARONI, Renato et al. On the performance of planning through backpropagation. 2020, Anais.. Cham: Springer, 2020. Disponível em: https://doi.org/10.1007/978-3-030-61380-8_8. Acesso em: 28 maio 2024.
APA
Scaroni, R., Bueno, T. P., Barros, L. N. de, & Mauá, D. D. (2020). On the performance of planning through backpropagation. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-61380-8_8
NLM
Scaroni R, Bueno TP, Barros LN de, Mauá DD. On the performance of planning through backpropagation [Internet]. Proceedings. 2020 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.1007/978-3-030-61380-8_8
Vancouver
Scaroni R, Bueno TP, Barros LN de, Mauá DD. On the performance of planning through backpropagation [Internet]. Proceedings. 2020 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.1007/978-3-030-61380-8_8
Trabalho de evento
Decision-aware model learning for actor-critic methods: when theory does not meet practice (2020)
Lovatto, Ângelo Gregório ; Bueno, Thiago Pereira ; Mauá, Denis Deratani ; Barros, Leliane Nunes de
Source: Proceedings. Conference titles: Conference on Neural Information Processing Systems - NeurIPS. Unidade: IME
Subjects: APRENDIZADO COMPUTACIONAL, MODELOS DE APRENDIZAGEM
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LOVATTO, Ângelo Gregório et al. Decision-aware model learning for actor-critic methods: when theory does not meet practice. 2020, Anais.. San Diego: NeurIPS, 2020. Disponível em: https://openreview.net/pdf?id=a9lwn6v40C4. Acesso em: 28 maio 2024.
APA
Lovatto, Â. G., Bueno, T. P., Mauá, D. D., & Barros, L. N. de. (2020). Decision-aware model learning for actor-critic methods: when theory does not meet practice. In Proceedings. San Diego: NeurIPS. Recuperado de https://openreview.net/pdf?id=a9lwn6v40C4
NLM
Lovatto ÂG, Bueno TP, Mauá DD, Barros LN de. Decision-aware model learning for actor-critic methods: when theory does not meet practice [Internet]. Proceedings. 2020 ;[citado 2024 maio 28 ] Available from: https://openreview.net/pdf?id=a9lwn6v40C4
Vancouver
Lovatto ÂG, Bueno TP, Mauá DD, Barros LN de. Decision-aware model learning for actor-critic methods: when theory does not meet practice [Internet]. Proceedings. 2020 ;[citado 2024 maio 28 ] Available from: https://openreview.net/pdf?id=a9lwn6v40C4
Trabalho de evento
A contact network-based approach for online planning of containment measures for COVID-19 (2020)
Thomaz, Guilherme Yambanis ; Mauá, Denis Deratani ; Barros, Leliane Nunes de
Source: Anais. Conference titles: Encontro Nacional de Inteligência Artificial e Computacional - ENIAC. Unidade: IME
Subjects: PROCESSOS ESTOCÁSTICOS, REDES COMPLEXAS, COVID-19
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
THOMAZ, Guilherme Yambanis e MAUÁ, Denis Deratani e BARROS, Leliane Nunes de. A contact network-based approach for online planning of containment measures for COVID-19. 2020, Anais.. Porto Alegre: SBC, 2020. Disponível em: https://doi.org/10.5753/eniac.2020.12132. Acesso em: 28 maio 2024.
APA
Thomaz, G. Y., Mauá, D. D., & Barros, L. N. de. (2020). A contact network-based approach for online planning of containment measures for COVID-19. In Anais. Porto Alegre: SBC. doi:10.5753/eniac.2020.12132
NLM
Thomaz GY, Mauá DD, Barros LN de. A contact network-based approach for online planning of containment measures for COVID-19 [Internet]. Anais. 2020 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.5753/eniac.2020.12132
Vancouver
Thomaz GY, Mauá DD, Barros LN de. A contact network-based approach for online planning of containment measures for COVID-19 [Internet]. Anais. 2020 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.5753/eniac.2020.12132
Trabalho de evento
Prediction of environmental conditions for maritime navigation using a network of sensors: a practical application of graph neural networks (2020)
Deberaldini Netto, Caio Fabrício; Tannuri, Eduardo Aoun ; Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: Proceedings. Conference titles: Symposium on Knowledge Discovery, Mining and Learning - KDMiLe. Unidades: EP, IME
Subjects: REDES NEURAIS, ANÁLISE DE SÉRIES TEMPORAIS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DEBERALDINI NETTO, Caio Fabrício et al. Prediction of environmental conditions for maritime navigation using a network of sensors: a practical application of graph neural networks. 2020, Anais.. Porto Alegre: SBC, 2020. Disponível em: https://doi.org/10.5753/kdmile.2020.11981. Acesso em: 28 maio 2024.
APA
Deberaldini Netto, C. F., Tannuri, E. A., Mauá, D. D., & Cozman, F. G. (2020). Prediction of environmental conditions for maritime navigation using a network of sensors: a practical application of graph neural networks. In Proceedings. Porto Alegre: SBC. doi:10.5753/kdmile.2020.11981
NLM
Deberaldini Netto CF, Tannuri EA, Mauá DD, Cozman FG. Prediction of environmental conditions for maritime navigation using a network of sensors: a practical application of graph neural networks [Internet]. Proceedings. 2020 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.5753/kdmile.2020.11981
Vancouver
Deberaldini Netto CF, Tannuri EA, Mauá DD, Cozman FG. Prediction of environmental conditions for maritime navigation using a network of sensors: a practical application of graph neural networks [Internet]. Proceedings. 2020 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.5753/kdmile.2020.11981
Trabalho de evento
Deep reactive policies for planning in stochastic nonlinear domains (2019)
Bueno, Thiago Pereira; Barros, Leliane Nunes de ; Mauá, Denis Deratani ; Sanner, Scott
Source: Proceedings. Conference titles: AAAI Conference on Artificial Intelligence. Unidade: IME
Assunto: APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, Thiago Pereira et al. Deep reactive policies for planning in stochastic nonlinear domains. 2019, Anais.. Palo Alto: AAAI, 2019. Disponível em: https://doi.org/10.1609/aaai.v33i01.33017530. Acesso em: 28 maio 2024.
APA
Bueno, T. P., Barros, L. N. de, Mauá, D. D., & Sanner, S. (2019). Deep reactive policies for planning in stochastic nonlinear domains. In Proceedings. Palo Alto: AAAI. doi:10.1609/aaai.v33i01.33017530
NLM
Bueno TP, Barros LN de, Mauá DD, Sanner S. Deep reactive policies for planning in stochastic nonlinear domains [Internet]. Proceedings. 2019 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.1609/aaai.v33i01.33017530
Vancouver
Bueno TP, Barros LN de, Mauá DD, Sanner S. Deep reactive policies for planning in stochastic nonlinear domains [Internet]. Proceedings. 2019 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.1609/aaai.v33i01.33017530
Trabalho de evento
End-to-end imitation learning of lane following policies using sum-product networks (2019)
Geh, Renato Lui; Mauá, Denis Deratani
Source: Anais. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: IME
Subjects: INTELIGÊNCIA ARTIFICIAL, APRENDIZAGEM PROFUNDA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GEH, Renato Lui e MAUÁ, Denis Deratani. End-to-end imitation learning of lane following policies using sum-product networks. 2019, Anais.. Porto Alegre: SBC, 2019. Disponível em: https://doi.org/10.5753/eniac.2019.9292. Acesso em: 28 maio 2024.
APA
Geh, R. L., & Mauá, D. D. (2019). End-to-end imitation learning of lane following policies using sum-product networks. In Anais. Porto Alegre: SBC. doi:10.5753/eniac.2019.9292
NLM
Geh RL, Mauá DD. End-to-end imitation learning of lane following policies using sum-product networks [Internet]. Anais. 2019 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.5753/eniac.2019.9292
Vancouver
Geh RL, Mauá DD. End-to-end imitation learning of lane following policies using sum-product networks [Internet]. Anais. 2019 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.5753/eniac.2019.9292
Trabalho de evento-anais periodico
Robust analysis of MAP inference in selective sum-product nNetworks (2019)
Villanueva Llerena, Julissa Giuliana ; Mauá, Denis Deratani
Source: Proceedings of Machine Learning Research : PMLR. Conference titles: International Symposium on Imprecise Probabilities: Theories and Applications - ISIPTA. Unidade: IME
Subjects: INTELIGÊNCIA ARTIFICIAL, RACIOCÍNIO PROBABILÍSTICO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VILLANUEVA LLERENA, Julissa Giuliana e MAUÁ, Denis Deratani. Robust analysis of MAP inference in selective sum-product nNetworks. Proceedings of Machine Learning Research : PMLR. Brookline: Microtome Publishing. Disponível em: http://proceedings.mlr.press/v103/villanueva-llerena19a/villanueva-llerena19a.pdf. Acesso em: 28 maio 2024. , 2019
APA
Villanueva Llerena, J. G., & Mauá, D. D. (2019). Robust analysis of MAP inference in selective sum-product nNetworks. Proceedings of Machine Learning Research : PMLR. Brookline: Microtome Publishing. Recuperado de http://proceedings.mlr.press/v103/villanueva-llerena19a/villanueva-llerena19a.pdf
NLM
Villanueva Llerena JG, Mauá DD. Robust analysis of MAP inference in selective sum-product nNetworks [Internet]. Proceedings of Machine Learning Research : PMLR. 2019 ; 103 430–440.[citado 2024 maio 28 ] Available from: http://proceedings.mlr.press/v103/villanueva-llerena19a/villanueva-llerena19a.pdf
Vancouver
Villanueva Llerena JG, Mauá DD. Robust analysis of MAP inference in selective sum-product nNetworks [Internet]. Proceedings of Machine Learning Research : PMLR. 2019 ; 103 430–440.[citado 2024 maio 28 ] Available from: http://proceedings.mlr.press/v103/villanueva-llerena19a/villanueva-llerena19a.pdf
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: 28 maio 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 maio 28 ] 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 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2019.04.003
Artigo de periodico
Speeding up parameter and rule learning for acyclic probabilistic logic programs (2019)
Faria, Francisco Henrique Otte Vieira de ; Gusmão, Arthur Colombini ; De Bona, Glauber ; Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: International Journal of Approximate Reasoning. Unidades: EP, IME
Subjects: PROGRAMAÇÃO LÓGICA, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FARIA, Francisco Henrique Otte Vieira de et al. Speeding up parameter and rule learning for acyclic probabilistic logic programs. International Journal of Approximate Reasoning, v. 106, p. 32-50, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2018.12.012. Acesso em: 28 maio 2024.
APA
Faria, F. H. O. V. de, Gusmão, A. C., De Bona, G., Mauá, D. D., & Cozman, F. G. (2019). Speeding up parameter and rule learning for acyclic probabilistic logic programs. International Journal of Approximate Reasoning, 106, 32-50. doi:10.1016/j.ijar.2018.12.012
NLM
Faria FHOV de, Gusmão AC, De Bona G, Mauá DD, Cozman FG. Speeding up parameter and rule learning for acyclic probabilistic logic programs [Internet]. International Journal of Approximate Reasoning. 2019 ; 106 32-50.[citado 2024 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2018.12.012
Vancouver
Faria FHOV de, Gusmão AC, De Bona G, Mauá DD, Cozman FG. Speeding up parameter and rule learning for acyclic probabilistic logic programs [Internet]. International Journal of Approximate Reasoning. 2019 ; 106 32-50.[citado 2024 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2018.12.012
Trabalho de evento
Advances in automatically solving the ENEM (2018)
Silveira, Igor Cataneo; Mauá, Denis Deratani
Source: Proceedings. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: IME
Subjects: RECUPERAÇÃO DA INFORMAÇÃO, SISTEMAS BASEADOS EM CONHECIMENTO, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVEIRA, Igor Cataneo e MAUÁ, Denis Deratani. Advances in automatically solving the ENEM. 2018, Anais.. Piscataway: IEEE, 2018. Disponível em: https://doi.org/10.1109/BRACIS.2018.00016. Acesso em: 28 maio 2024.
APA
Silveira, I. C., & Mauá, D. D. (2018). Advances in automatically solving the ENEM. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2018.00016
NLM
Silveira IC, Mauá DD. Advances in automatically solving the ENEM [Internet]. Proceedings. 2018 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.1109/BRACIS.2018.00016
Vancouver
Silveira IC, Mauá DD. Advances in automatically solving the ENEM [Internet]. Proceedings. 2018 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.1109/BRACIS.2018.00016
Trabalho de evento
University entrance exam as a guiding test for artificial intelligence (2018)
Silveira, Igor Cataneo; Mauá, Denis Deratani
Source: Proceedings. Conference titles: Brazilian Conference on Intelligent Systems (BRACIS). Unidade: IME
Subjects: INTELIGÊNCIA ARTIFICIAL, PROCESSAMENTO DE LINGUAGEM NATURAL, RECUPERAÇÃO DA INFORMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVEIRA, Igor Cataneo e MAUÁ, Denis Deratani. University entrance exam as a guiding test for artificial intelligence. 2018, Anais.. Piscataway: IEEE, 2018. Disponível em: https://doi.org/10.1109/BRACIS.2017.44. Acesso em: 28 maio 2024.
APA
Silveira, I. C., & Mauá, D. D. (2018). University entrance exam as a guiding test for artificial intelligence. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2017.44
NLM
Silveira IC, Mauá DD. University entrance exam as a guiding test for artificial intelligence [Internet]. Proceedings. 2018 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.1109/BRACIS.2017.44
Vancouver
Silveira IC, Mauá DD. University entrance exam as a guiding test for artificial intelligence [Internet]. Proceedings. 2018 ;[citado 2024 maio 28 ] Available from: https://doi.org/10.1109/BRACIS.2017.44
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: 28 maio 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 maio 28 ] 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 maio 28 ] Available from: https://doi.org/10.1016/j.artint.2018.06.001
Artigo de periodico
Robustifying sum-product networks (2018)
Mauá, Denis Deratani ; Conaty, Diarmaid; Cozman, Fabio Gagliardi ; Poppenhaeger, Katja; Campos, Cassio Polpo de
Source: International Journal of Approximate Reasoning. Unidades: IME, EP
Subjects: INTELIGÊNCIA ARTIFICIAL, MODELOS PARA PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani et al. Robustifying sum-product networks. International Journal of Approximate Reasoning, v. 101, p. 163-180, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2018.07.003. Acesso em: 28 maio 2024.
APA
Mauá, D. D., Conaty, D., Cozman, F. G., Poppenhaeger, K., & Campos, C. P. de. (2018). Robustifying sum-product networks. International Journal of Approximate Reasoning, 101, 163-180. doi:10.1016/j.ijar.2018.07.003
NLM
Mauá DD, Conaty D, Cozman FG, Poppenhaeger K, Campos CP de. Robustifying sum-product networks [Internet]. International Journal of Approximate Reasoning. 2018 ; 101 163-180.[citado 2024 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2018.07.003
Vancouver
Mauá DD, Conaty D, Cozman FG, Poppenhaeger K, Campos CP de. Robustifying sum-product networks [Internet]. International Journal of Approximate Reasoning. 2018 ; 101 163-180.[citado 2024 maio 28 ] Available from: https://doi.org/10.1016/j.ijar.2018.07.003

USP Schools

ReP

Filtros

Document Types

USP Schools

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