ReP USP - Resultado da busca

Trabalho de evento
Multilinear and linear programs for partially identifiable queries in quasi-markovian structural causal models (2025)
Arroyo, João Pedro; Mauá, Denis Deratani ; Rodrigues, João Gabriel Barreto; Lawand, Daniel A. E.; Lee, Junkyu; Marinescu, Radu; Gray, Alex; Laurentino, Eduardo Rocha; Cozman, Fabio Gagliardi
Fonte: Proceedings. Nome do evento: Conference on Uncertainty in Artificial Intelligence - UAI. Unidades: IME, EP
Assuntos: ÁLGEBRA MULTILINEAR, ANÁLISE CAUSAL, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARROYO, João Pedro et al. Multilinear and linear programs for partially identifiable queries in quasi-markovian structural causal models. 2025, Anais.. Corvallis: AUAI Press, 2025. p. 1-14. Disponível em: https://openreview.net/pdf?id=aUPT1kEiwP. Acesso em: 08 out. 2025.
APA
Arroyo, J. P., Mauá, D. D., Rodrigues, J. G. B., Lawand, D. A. E., Lee, J., Marinescu, R., et al. (2025). Multilinear and linear programs for partially identifiable queries in quasi-markovian structural causal models. In Proceedings (p. 1-14). Corvallis: AUAI Press. Recuperado de https://openreview.net/pdf?id=aUPT1kEiwP
NLM
Arroyo JP, Mauá DD, Rodrigues JGB, Lawand DAE, Lee J, Marinescu R, Gray A, Laurentino ER, Cozman FG. Multilinear and linear programs for partially identifiable queries in quasi-markovian structural causal models [Internet]. Proceedings. 2025 ; 1-14.[citado 2025 out. 08 ] Available from: https://openreview.net/pdf?id=aUPT1kEiwP
Vancouver
Arroyo JP, Mauá DD, Rodrigues JGB, Lawand DAE, Lee J, Marinescu R, Gray A, Laurentino ER, Cozman FG. Multilinear and linear programs for partially identifiable queries in quasi-markovian structural causal models [Internet]. Proceedings. 2025 ; 1-14.[citado 2025 out. 08 ] Available from: https://openreview.net/pdf?id=aUPT1kEiwP
Trabalho de evento
Large language models as tools to improve Bayesian causal discovery (2025)
Bazaluk, Bruna ; Wang, Benjie; Mauá, Denis Deratani ; Silva, Flávio Soares Corrêa da
Fonte: Proceedings. Nome do evento: Conference on Uncertainty in Artificial Intelligence - UAI. Unidade: IME
Assuntos: INFERÊNCIA BAYESIANA, LINGUAGEM, ANÁLISE CAUSAL, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BAZALUK, Bruna et al. Large language models as tools to improve Bayesian causal discovery. 2025, Anais.. Corvallis: AUAI Press, 2025. p. 1-13. Disponível em: https://openreview.net/pdf?id=k3qX5G46zw. Acesso em: 08 out. 2025.
APA
Bazaluk, B., Wang, B., Mauá, D. D., & Silva, F. S. C. da. (2025). Large language models as tools to improve Bayesian causal discovery. In Proceedings (p. 1-13). Corvallis: AUAI Press. Recuperado de https://openreview.net/pdf?id=k3qX5G46zw
NLM
Bazaluk B, Wang B, Mauá DD, Silva FSC da. Large language models as tools to improve Bayesian causal discovery [Internet]. Proceedings. 2025 ; 1-13.[citado 2025 out. 08 ] Available from: https://openreview.net/pdf?id=k3qX5G46zw
Vancouver
Bazaluk B, Wang B, Mauá DD, Silva FSC da. Large language models as tools to improve Bayesian causal discovery [Internet]. Proceedings. 2025 ; 1-13.[citado 2025 out. 08 ] Available from: https://openreview.net/pdf?id=k3qX5G46zw
Trabalho de evento
Nonparametric estimation of the average causal effect using the front-door criterion (2025)
Cavalcante, Ana Paula Lopes; Izbicki, Rafael ; Stern, Rafael Bassi
Fonte: Proceedings. Nome do evento: Conference on Uncertainty in Artificial Intelligence - UAI. Unidade: IME
Assuntos: ESTIMAÇÃO NÃO PARAMÉTRICA, ANÁLISE CAUSAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAVALCANTE, Ana Paula Lopes e IZBICKI, Rafael e STERN, Rafael Bassi. Nonparametric estimation of the average causal effect using the front-door criterion. 2025, Anais.. Corvallis: AUAI Press, 2025. p. 1-15. Disponível em: https://openreview.net/pdf?id=1c6A74tLOd. Acesso em: 08 out. 2025.
APA
Cavalcante, A. P. L., Izbicki, R., & Stern, R. B. (2025). Nonparametric estimation of the average causal effect using the front-door criterion. In Proceedings (p. 1-15). Corvallis: AUAI Press. Recuperado de https://openreview.net/pdf?id=1c6A74tLOd
NLM
Cavalcante APL, Izbicki R, Stern RB. Nonparametric estimation of the average causal effect using the front-door criterion [Internet]. Proceedings. 2025 ; 1-15.[citado 2025 out. 08 ] Available from: https://openreview.net/pdf?id=1c6A74tLOd
Vancouver
Cavalcante APL, Izbicki R, Stern RB. Nonparametric estimation of the average causal effect using the front-door criterion [Internet]. Proceedings. 2025 ; 1-15.[citado 2025 out. 08 ] Available from: https://openreview.net/pdf?id=1c6A74tLOd
Trabalho de evento
On modal clustering with Gaussian Sum-Product Networks (2023)
Madeira, Tiago; Mauá, Denis Deratani
Fonte: Proceedings. Nome do evento: Conference on Uncertainty in Artificial Intelligence. Unidade: IME
Assuntos: MODELOS PARA PROCESSOS ESTOCÁSTICOS, APRENDIZADO COMPUTACIONAL, RACIOCÍNIO PROBABILÍSTICO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MADEIRA, Tiago e MAUÁ, Denis Deratani. On modal clustering with Gaussian Sum-Product Networks. 2023, Anais.. Corvallis: AUAI Press, 2023. Disponível em: https://openreview.net/pdf?id=dtzAUOmHqa. Acesso em: 08 out. 2025.
APA
Madeira, T., & Mauá, D. D. (2023). On modal clustering with Gaussian Sum-Product Networks. In Proceedings. Corvallis: AUAI Press. Recuperado de https://openreview.net/pdf?id=dtzAUOmHqa
NLM
Madeira T, Mauá DD. On modal clustering with Gaussian Sum-Product Networks [Internet]. Proceedings. 2023 ;[citado 2025 out. 08 ] Available from: https://openreview.net/pdf?id=dtzAUOmHqa
Vancouver
Madeira T, Mauá DD. On modal clustering with Gaussian Sum-Product Networks [Internet]. Proceedings. 2023 ;[citado 2025 out. 08 ] Available from: https://openreview.net/pdf?id=dtzAUOmHqa
Trabalho de evento
Approximation complexity of maximum a posteriori inference in sum-product networks (2017)
Conaty, Diarmaid; Mauá, Denis Deratani ; Campos, Cassio P. de
Fonte: Proceedings. Nome do evento: Conference on Uncertainty in Artificial Intelligence. Unidade: IME
Assuntos: 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
CONATY, Diarmaid e MAUÁ, Denis Deratani e CAMPOS, Cassio P. de. Approximation complexity of maximum a posteriori inference in sum-product networks. 2017, Anais.. Corvallis: AUAI Press, 2017. Disponível em: http://auai.org/uai2017/proceedings/papers/109.pdf. Acesso em: 08 out. 2025.
APA
Conaty, D., Mauá, D. D., & Campos, C. P. de. (2017). Approximation complexity of maximum a posteriori inference in sum-product networks. In Proceedings. Corvallis: AUAI Press. Recuperado de http://auai.org/uai2017/proceedings/papers/109.pdf
NLM
Conaty D, Mauá DD, Campos CP de. Approximation complexity of maximum a posteriori inference in sum-product networks [Internet]. Proceedings. 2017 ;[citado 2025 out. 08 ] Available from: http://auai.org/uai2017/proceedings/papers/109.pdf
Vancouver
Conaty D, Mauá DD, Campos CP de. Approximation complexity of maximum a posteriori inference in sum-product networks [Internet]. Proceedings. 2017 ;[citado 2025 out. 08 ] Available from: http://auai.org/uai2017/proceedings/papers/109.pdf
Trabalho de evento
Bounded approximate symbolic dynamic programming for hybrid MDPs (2013)
Vianna, Luis Gustavo Rocha; Sanner, Scott; Barros, Leliane Nunes de
Fonte: Proceedings. Nome do evento: Conference on Uncertainty in Artificial Intelligence - UAI. Unidade: IME
Assuntos: CONTROLE (TEORIA DE SISTEMAS E CONTROLE), PROCESSOS DE MARKOV
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VIANNA, Luis Gustavo Rocha e SANNER, Scott e BARROS, Leliane Nunes de. Bounded approximate symbolic dynamic programming for hybrid MDPs. 2013, Anais.. Corvallis: AUAI Press, 2013. Disponível em: https://www.auai.org/uai2013/prints/proceedings.pdf. Acesso em: 08 out. 2025.
APA
Vianna, L. G. R., Sanner, S., & Barros, L. N. de. (2013). Bounded approximate symbolic dynamic programming for hybrid MDPs. In Proceedings. Corvallis: AUAI Press. Recuperado de https://www.auai.org/uai2013/prints/proceedings.pdf
NLM
Vianna LGR, Sanner S, Barros LN de. Bounded approximate symbolic dynamic programming for hybrid MDPs [Internet]. Proceedings. 2013 ;[citado 2025 out. 08 ] Available from: https://www.auai.org/uai2013/prints/proceedings.pdf
Vancouver
Vianna LGR, Sanner S, Barros LN de. Bounded approximate symbolic dynamic programming for hybrid MDPs [Internet]. Proceedings. 2013 ;[citado 2025 out. 08 ] Available from: https://www.auai.org/uai2013/prints/proceedings.pdf
Trabalho de evento
Symbolic dynamic programming for discrete and continuous state MDPs (2011)
Sanner, Scott; Delgado, Karina Valdivia ; Barros, Leliane Nunes de
Fonte: Proceedings. Nome do evento: Conference on Uncertainty in Artificial Intelligence - UAI. Unidades: EACH, IME
Assuntos: INTELIGÊNCIA ARTIFICIAL, PROCESSOS DE MARKOV, PROGRAMAÇÃO DINÂMICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANNER, Scott e DELGADO, Karina Valdivia e BARROS, Leliane Nunes de. Symbolic dynamic programming for discrete and continuous state MDPs. 2011, Anais.. Arlington: AUAI Press, 2011. Disponível em: https://doi.org/10.5555/3020548.3020623. Acesso em: 08 out. 2025.
APA
Sanner, S., Delgado, K. V., & Barros, L. N. de. (2011). Symbolic dynamic programming for discrete and continuous state MDPs. In Proceedings. Arlington: AUAI Press. doi:10.5555/3020548.3020623
NLM
Sanner S, Delgado KV, Barros LN de. Symbolic dynamic programming for discrete and continuous state MDPs [Internet]. Proceedings. 2011 ;[citado 2025 out. 08 ] Available from: https://doi.org/10.5555/3020548.3020623
Vancouver
Sanner S, Delgado KV, Barros LN de. Symbolic dynamic programming for discrete and continuous state MDPs [Internet]. Proceedings. 2011 ;[citado 2025 out. 08 ] Available from: https://doi.org/10.5555/3020548.3020623

Unidades USP

ReP

Filtros

Autores

Autores USP

Assuntos

Agência de fomento

Afiliação dos autores externos não normalizada