Fast local search methods for solving limited memory influence diagrams (2016)
- Authors:
- USP affiliated authors: MAUÁ, DENIS DERATANI - IME ; COZMAN, FABIO GAGLIARDI - EP
- Unidades: IME; EP
- DOI: 10.1016/j.ijar.2015.05.003
- Subjects: MODELOS PARA PROCESSOS ESTOCÁSTICOS; INTELIGÊNCIA ARTIFICIAL; PROBABILIDADE APLICADA
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: International Journal of Approximate Reasoning
- ISSN: 1873-4731
- Volume/Número/Paginação/Ano: v. 68, p. 230-245, Jan. 2016
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: bronze
- Licença: elsevier-specific: oa user license
-
ABNT
MAUÁ, Denis Deratani; COZMAN, Fabio Gagliardi. Fast local search methods for solving limited memory influence diagrams. International Journal of Approximate Reasoning, New York, v. 68, n. Ja 2016, p. 230-245, 2016. Disponível em: < http://dx.doi.org/10.1016/j.ijar.2015.05.003 > DOI: 10.1016/j.ijar.2015.05.003. -
APA
Mauá, D. D., & Cozman, F. G. (2016). Fast local search methods for solving limited memory influence diagrams. International Journal of Approximate Reasoning, 68( Ja 2016), 230-245. doi:10.1016/j.ijar.2015.05.003 -
NLM
Mauá DD, Cozman FG. Fast local search methods for solving limited memory influence diagrams [Internet]. International Journal of Approximate Reasoning. 2016 ; 68( Ja 2016): 230-245.Available from: http://dx.doi.org/10.1016/j.ijar.2015.05.003 -
Vancouver
Mauá DD, Cozman FG. Fast local search methods for solving limited memory influence diagrams [Internet]. International Journal of Approximate Reasoning. 2016 ; 68( Ja 2016): 230-245.Available from: http://dx.doi.org/10.1016/j.ijar.2015.05.003 - A tractable class of model counting problems
- The complexity of inferences and explanations in probabilistic logic programming
- The finite model theory of bayesian networks: descriptive complexity
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- On the semantics and complexity of probabilistic logic programs
- Credal sum-product networks
- On the complexity of propositional and relational credal networks
- DL-Lite Bayesian networks: a tractable probabilistic graphical model
- Specifying probabilistic relational models with description logics
- Probabilistic graphical models specified by probabilistic logic programs: semantics and complexit
Informações sobre o DOI: 10.1016/j.ijar.2015.05.003 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
