ReP USP - Resultado da busca

Artigo de periodico
GUBS criterion: arbitrary trade-offs between cost and probability-to-goal in stochastic planning based on expected utility theory (2023)
Crispino, Gabriel Nunes; Silva, Valdinei Freire da ; Delgado, Karina Valdivia
Source: Artificial Intelligence. Unidades: EACH, IME
Subjects: PROCESSOS DE MARKOV, ESTATÍSTICA DE PROCESSOS ESTOCÁSTICOS, TOMADA DE DECISÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CRISPINO, Gabriel Nunes e SILVA, Valdinei Freire da e DELGADO, Karina Valdivia. GUBS criterion: arbitrary trade-offs between cost and probability-to-goal in stochastic planning based on expected utility theory. Artificial Intelligence, v. 316, p. 103848 ( 01-45), 2023Tradução . . Disponível em: https://doi.org/10.1016/j.artint.2022.103848. Acesso em: 23 abr. 2024.
APA
Crispino, G. N., Silva, V. F. da, & Delgado, K. V. (2023). GUBS criterion: arbitrary trade-offs between cost and probability-to-goal in stochastic planning based on expected utility theory. Artificial Intelligence, 316, 103848 ( 01-45). doi:10.1016/j.artint.2022.103848
NLM
Crispino GN, Silva VF da, Delgado KV. GUBS criterion: arbitrary trade-offs between cost and probability-to-goal in stochastic planning based on expected utility theory [Internet]. Artificial Intelligence. 2023 ; 316 103848 ( 01-45).[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.artint.2022.103848
Vancouver
Crispino GN, Silva VF da, Delgado KV. GUBS criterion: arbitrary trade-offs between cost and probability-to-goal in stochastic planning based on expected utility theory [Internet]. Artificial Intelligence. 2023 ; 316 103848 ( 01-45).[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.artint.2022.103848
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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] Available from: https://doi.org/10.1016/j.artint.2018.06.001
Artigo de periodico
Real-time dynamic programming for Markov decision processes with imprecise probabilities (2016)
Delgado, Karina Valdivia; Barros, Leliane Nunes de ; Dias, Daniel Baptista; Sanner, Scott
Source: Artificial Intelligence. Unidades: EACH, IME
Subjects: INTELIGÊNCIA ARTIFICIAL, PROCESSOS DE MARKOV, ROBUSTEZ
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELGADO, Karina Valdivia et al. Real-time dynamic programming for Markov decision processes with imprecise probabilities. Artificial Intelligence, v. 230, n. Ja 2016, p. 192–223, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.artint.2015.09.005. Acesso em: 23 abr. 2024.
APA
Delgado, K. V., Barros, L. N. de, Dias, D. B., & Sanner, S. (2016). Real-time dynamic programming for Markov decision processes with imprecise probabilities. Artificial Intelligence, 230( Ja 2016), 192–223. doi:10.1016/j.artint.2015.09.005
NLM
Delgado KV, Barros LN de, Dias DB, Sanner S. Real-time dynamic programming for Markov decision processes with imprecise probabilities [Internet]. Artificial Intelligence. 2016 ; 230( Ja 2016): 192–223.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.artint.2015.09.005
Vancouver
Delgado KV, Barros LN de, Dias DB, Sanner S. Real-time dynamic programming for Markov decision processes with imprecise probabilities [Internet]. Artificial Intelligence. 2016 ; 230( Ja 2016): 192–223.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.artint.2015.09.005
Artigo de periodico
Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation (2015)
De Bona, Glauber ; Finger, Marcelo
Source: Artificial Intelligence. Unidades: EP, 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
DE BONA, Glauber e FINGER, Marcelo. Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation. Artificial Intelligence, v. 227, p. 140-164, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.artint.2015.06.006. Acesso em: 23 abr. 2024.
APA
De Bona, G., & Finger, M. (2015). Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation. Artificial Intelligence, 227, 140-164. doi:10.1016/j.artint.2015.06.006
NLM
De Bona G, Finger M. Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation [Internet]. Artificial Intelligence. 2015 ; 227 140-164.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.artint.2015.06.006
Vancouver
De Bona G, Finger M. Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation [Internet]. Artificial Intelligence. 2015 ; 227 140-164.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.artint.2015.06.006
Artigo de periodico
Sequential decision making with partially ordered preferences (2011)
Kikuti, Daniel; Cozman, Fabio Gagliardi ; Shirota Filho, Ricardo
Source: Artificial Intelligence. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, ALGORITMOS PARA IMAGENS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KIKUTI, Daniel e COZMAN, Fabio Gagliardi e SHIROTA FILHO, Ricardo. Sequential decision making with partially ordered preferences. Artificial Intelligence, v. 175, n. 7-8, p. 1346-1365, 2011Tradução . . Disponível em: https://doi.org/10.1016/j.artint.2010.11.017. Acesso em: 23 abr. 2024.
APA
Kikuti, D., Cozman, F. G., & Shirota Filho, R. (2011). Sequential decision making with partially ordered preferences. Artificial Intelligence, 175( 7-8), 1346-1365. doi:10.1016/j.artint.2010.11.017
NLM
Kikuti D, Cozman FG, Shirota Filho R. Sequential decision making with partially ordered preferences [Internet]. Artificial Intelligence. 2011 ; 175( 7-8): 1346-1365.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.artint.2010.11.017
Vancouver
Kikuti D, Cozman FG, Shirota Filho R. Sequential decision making with partially ordered preferences [Internet]. Artificial Intelligence. 2011 ; 175( 7-8): 1346-1365.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.artint.2010.11.017
Artigo de periodico
Efficient solutions to factored MDPs with imprecise transition probabilities (2011)
Delgado, Karina Valdivia; Sanner, Scott; Barros, Leliane Nunes de
Source: Artificial Intelligence. Unidades: EACH, IME
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELGADO, Karina Valdivia e SANNER, Scott e BARROS, Leliane Nunes de. Efficient solutions to factored MDPs with imprecise transition probabilities. Artificial Intelligence, v. 175, n. ju 2011, p. 1498-1527, 2011Tradução . . Disponível em: https://doi.org/10.1016/j.artint.2011.01.001. Acesso em: 23 abr. 2024.
APA
Delgado, K. V., Sanner, S., & Barros, L. N. de. (2011). Efficient solutions to factored MDPs with imprecise transition probabilities. Artificial Intelligence, 175( ju 2011), 1498-1527. doi:10.1016/j.artint.2011.01.001
NLM
Delgado KV, Sanner S, Barros LN de. Efficient solutions to factored MDPs with imprecise transition probabilities [Internet]. Artificial Intelligence. 2011 ; 175( ju 2011): 1498-1527.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.artint.2011.01.001
Vancouver
Delgado KV, Sanner S, Barros LN de. Efficient solutions to factored MDPs with imprecise transition probabilities [Internet]. Artificial Intelligence. 2011 ; 175( ju 2011): 1498-1527.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.artint.2011.01.001
Artigo de periodico
Credal networks (2000)
Cozman, Fabio Gagliardi
Source: Artificial Intelligence. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, PROBABILIDADE E ESTATISTICA, ROBÓTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi. Credal networks. Artificial Intelligence, v. 120, n. 2, p. 199-233, 2000Tradução . . Disponível em: https://doi.org/10.1016/s0004-3702(00)00029-1. Acesso em: 23 abr. 2024.
APA
Cozman, F. G. (2000). Credal networks. Artificial Intelligence, 120( 2), 199-233. doi:10.1016/s0004-3702(00)00029-1
NLM
Cozman FG. Credal networks [Internet]. Artificial Intelligence. 2000 ; 120( 2): 199-233.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/s0004-3702(00)00029-1
Vancouver
Cozman FG. Credal networks [Internet]. Artificial Intelligence. 2000 ; 120( 2): 199-233.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/s0004-3702(00)00029-1

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Indexado em