ReP USP - Resultado da busca

Editor de periodico
International Journal of Approximate Reasoning (2021)
Mauá, Denis Deratani (Editor) ; Campos, Cassio Polpo de (Editor)
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
International Journal of Approximate Reasoning. . Philadelphia: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://www.sciencedirect.com/journal/international-journal-of-approximate-reasoning/vol/137/suppl/C. Acesso em: 11 jun. 2024. , 2021
APA
International Journal of Approximate Reasoning. (2021). International Journal of Approximate Reasoning. Philadelphia: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de https://www.sciencedirect.com/journal/international-journal-of-approximate-reasoning/vol/137/suppl/C
NLM
International Journal of Approximate Reasoning [Internet]. 2021 ; 137 113.[citado 2024 jun. 11 ] Available from: https://www.sciencedirect.com/journal/international-journal-of-approximate-reasoning/vol/137/suppl/C
Vancouver
International Journal of Approximate Reasoning [Internet]. 2021 ; 137 113.[citado 2024 jun. 11 ] Available from: https://www.sciencedirect.com/journal/international-journal-of-approximate-reasoning/vol/137/suppl/C
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: 11 jun. 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 jun. 11 ] 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 jun. 11 ] Available from: https://doi.org/10.1016/j.ijar.2021.07.002
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: 11 jun. 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 jun. 11 ] 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 jun. 11 ] Available from: https://doi.org/10.1016/j.ijar.2018.07.003
Artigo de periodico
Hidden Markov models with set-valued parameters (2016)
Mauá, Denis Deratani ; Antonucci, Alessandro; Campos, Cassio Polpo de
Source: Neurocomputing. Unidade: IME
Subjects: PROCESSOS DE MARKOV, RECONHECIMENTO DE PADRÕES, ROBUSTEZ
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e ANTONUCCI, Alessandro e CAMPOS, Cassio Polpo de. Hidden Markov models with set-valued parameters. Neurocomputing, v. 180, p. 94-107, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.neucom.2015.08.095. Acesso em: 11 jun. 2024.
APA
Mauá, D. D., Antonucci, A., & Campos, C. P. de. (2016). Hidden Markov models with set-valued parameters. Neurocomputing, 180, 94-107. doi:10.1016/j.neucom.2015.08.095
NLM
Mauá DD, Antonucci A, Campos CP de. Hidden Markov models with set-valued parameters [Internet]. Neurocomputing. 2016 ; 180 94-107.[citado 2024 jun. 11 ] Available from: https://doi.org/10.1016/j.neucom.2015.08.095
Vancouver
Mauá DD, Antonucci A, Campos CP de. Hidden Markov models with set-valued parameters [Internet]. Neurocomputing. 2016 ; 180 94-107.[citado 2024 jun. 11 ] Available from: https://doi.org/10.1016/j.neucom.2015.08.095
Trabalho de evento
Early classification of time series by Hidden Markov Models with set-valued parameters (2015)
Antonucci, Alessandro; Mauá, Denis Deratani ; Scanagatta, Mauro; Campos, Cassio Polpo de
Source: Proceedings. Conference titles: NIPS Time Series Workshop 2015. Unidade: IME
Subjects: ANÁLISE DE SÉRIES TEMPORAIS, PROCESSOS DE MARKOV
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANTONUCCI, Alessandro et al. Early classification of time series by Hidden Markov Models with set-valued parameters. 2015, Anais.. Montreal: NIPS Foundation, 2015. Disponível em: https://drive.google.com/file/d/0Bx7depbNYaFIdjhPNEtsN1pDa2RBWVhPUmxYMURNdmp5a05n/view. Acesso em: 11 jun. 2024.
APA
Antonucci, A., Mauá, D. D., Scanagatta, M., & Campos, C. P. de. (2015). Early classification of time series by Hidden Markov Models with set-valued parameters. In Proceedings. Montreal: NIPS Foundation. Recuperado de https://drive.google.com/file/d/0Bx7depbNYaFIdjhPNEtsN1pDa2RBWVhPUmxYMURNdmp5a05n/view
NLM
Antonucci A, Mauá DD, Scanagatta M, Campos CP de. Early classification of time series by Hidden Markov Models with set-valued parameters [Internet]. Proceedings. 2015 ;[citado 2024 jun. 11 ] Available from: https://drive.google.com/file/d/0Bx7depbNYaFIdjhPNEtsN1pDa2RBWVhPUmxYMURNdmp5a05n/view
Vancouver
Antonucci A, Mauá DD, Scanagatta M, Campos CP de. Early classification of time series by Hidden Markov Models with set-valued parameters [Internet]. Proceedings. 2015 ;[citado 2024 jun. 11 ] Available from: https://drive.google.com/file/d/0Bx7depbNYaFIdjhPNEtsN1pDa2RBWVhPUmxYMURNdmp5a05n/view
Trabalho de evento
The complexity of MAP inference in Bayesian networks specified through logical languages (2015)
Mauá, Denis Deratani ; Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Source: Proceedings. Conference titles: International Joint Conference on Artificial Intelligence - IJCAI. Unidades: IME, EP
Subjects: COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL
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 e COZMAN, Fabio Gagliardi. The complexity of MAP inference in Bayesian networks specified through logical languages. 2015, Anais.. Palo Alto: AAAI Press / International Joint Conferences on Artificial Intelligence, 2015. Disponível em: http://ijcai.org/papers15/Papers/IJCAI15-130.pdf. Acesso em: 11 jun. 2024.
APA
Mauá, D. D., Campos, C. P. de, & Cozman, F. G. (2015). The complexity of MAP inference in Bayesian networks specified through logical languages. In Proceedings. Palo Alto: AAAI Press / International Joint Conferences on Artificial Intelligence. Recuperado de http://ijcai.org/papers15/Papers/IJCAI15-130.pdf
NLM
Mauá DD, Campos CP de, Cozman FG. The complexity of MAP inference in Bayesian networks specified through logical languages [Internet]. Proceedings. 2015 ;[citado 2024 jun. 11 ] Available from: http://ijcai.org/papers15/Papers/IJCAI15-130.pdf
Vancouver
Mauá DD, Campos CP de, Cozman FG. The complexity of MAP inference in Bayesian networks specified through logical languages [Internet]. Proceedings. 2015 ;[citado 2024 jun. 11 ] Available from: http://ijcai.org/papers15/Papers/IJCAI15-130.pdf
Trabalho de evento
Advances in learning Bayesian networks of bounded treewidth (2014)
Nie, Siqi; Mauá, Denis Deratani ; Campos, Cassio Polpo de; Ji, Qiang
Source: Advances in Neural Information Processing Systems, 27. Conference titles: Annual Conference on Neural Information Processing Systems - NIPS. Unidade: IME
Subjects: ALGORITMOS, INTELIGÊNCIA ARTIFICIAL, ANÁLISE DE ALGORITMOS, TEORIA DOS GRAFOS, COMBINATÓRIA, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NIE, Siqi et al. Advances in learning Bayesian networks of bounded treewidth. 2014, Anais.. Montreal: NIPS Foundation, 2014. Disponível em: http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf. Acesso em: 11 jun. 2024.
APA
Nie, S., Mauá, D. D., Campos, C. P. de, & Ji, Q. (2014). Advances in learning Bayesian networks of bounded treewidth. In Advances in Neural Information Processing Systems, 27. Montreal: NIPS Foundation. Recuperado de http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf
NLM
Nie S, Mauá DD, Campos CP de, Ji Q. Advances in learning Bayesian networks of bounded treewidth [Internet]. Advances in Neural Information Processing Systems, 27. 2014 ;[citado 2024 jun. 11 ] Available from: http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf
Vancouver
Nie S, Mauá DD, Campos CP de, Ji Q. Advances in learning Bayesian networks of bounded treewidth [Internet]. Advances in Neural Information Processing Systems, 27. 2014 ;[citado 2024 jun. 11 ] Available from: http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf
Artigo de periodico
Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms (2014)
Cozman, Fabio Gagliardi ; Campos, Cassio Polpo de
Source: International Journal of Approximate Reasoning. Unidade: EP
Subjects: PROBABILIDADE, INFERÊNCIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e CAMPOS, Cassio Polpo de. Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms. International Journal of Approximate Reasoning, v. 55, n. Ja 2014, p. 666\2013682, 2014Tradução . . Disponível em: http://www.sciencedirect.com/science/article/pii/S0888613X1300203X. Acesso em: 11 jun. 2024.
APA
Cozman, F. G., & Campos, C. P. de. (2014). Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms. International Journal of Approximate Reasoning, 55( Ja 2014), 666\2013682. doi:10.1016/j.ijar.2013.09.013
NLM
Cozman FG, Campos CP de. Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms [Internet]. International Journal of Approximate Reasoning. 2014 ; 55( Ja 2014): 666\2013682.[citado 2024 jun. 11 ] Available from: http://www.sciencedirect.com/science/article/pii/S0888613X1300203X
Vancouver
Cozman FG, Campos CP de. Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms [Internet]. International Journal of Approximate Reasoning. 2014 ; 55( Ja 2014): 666\2013682.[citado 2024 jun. 11 ] Available from: http://www.sciencedirect.com/science/article/pii/S0888613X1300203X
Trabalho de evento
Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks (2013)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Source: Proceedings. Conference titles: AAAI Conference on Artificial Intelligence. Unidade: EP
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks. 2013, Anais.. San Francisco: AAAI, 2013. Disponível em: https://repositorio.usp.br/directbitstream/beff8521-2d0c-4770-b720-196853d9f9f5/Cozman-2013-Complexity%20of%20inferences%20in%20polytree%20shaped%20semi%20qualitative%20ok.pdf. Acesso em: 11 jun. 2024.
APA
Campos, C. P. de, & Cozman, F. G. (2013). Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks. In Proceedings. San Francisco: AAAI. Recuperado de https://repositorio.usp.br/directbitstream/beff8521-2d0c-4770-b720-196853d9f9f5/Cozman-2013-Complexity%20of%20inferences%20in%20polytree%20shaped%20semi%20qualitative%20ok.pdf
NLM
Campos CP de, Cozman FG. Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks [Internet]. Proceedings. 2013 ;[citado 2024 jun. 11 ] Available from: https://repositorio.usp.br/directbitstream/beff8521-2d0c-4770-b720-196853d9f9f5/Cozman-2013-Complexity%20of%20inferences%20in%20polytree%20shaped%20semi%20qualitative%20ok.pdf
Vancouver
Campos CP de, Cozman FG. Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks [Internet]. Proceedings. 2013 ;[citado 2024 jun. 11 ] Available from: https://repositorio.usp.br/directbitstream/beff8521-2d0c-4770-b720-196853d9f9f5/Cozman-2013-Complexity%20of%20inferences%20in%20polytree%20shaped%20semi%20qualitative%20ok.pdf
Artigo de periodico
Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence (2009)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi ; Luna, José Eduardo Ochoa
Source: Journal of Applied Logic. Unidade: EP
Subjects: PROBABILIDADE, PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi e LUNA, José Eduardo Ochoa. Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence. Journal of Applied Logic, v. 7, p. 137-154, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.jal.2007.11.002. Acesso em: 11 jun. 2024.
APA
Campos, C. P. de, Cozman, F. G., & Luna, J. E. O. (2009). Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence. Journal of Applied Logic, 7, 137-154. doi:10.1016/j.jal.2007.11.002
NLM
Campos CP de, Cozman FG, Luna JEO. Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence [Internet]. Journal of Applied Logic. 2009 ; 7 137-154.[citado 2024 jun. 11 ] Available from: https://doi.org/10.1016/j.jal.2007.11.002
Vancouver
Campos CP de, Cozman FG, Luna JEO. Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence [Internet]. Journal of Applied Logic. 2009 ; 7 137-154.[citado 2024 jun. 11 ] Available from: https://doi.org/10.1016/j.jal.2007.11.002
Artigo de periodico
Probabilistic logic with independence (2008)
Cozman, Fabio Gagliardi ; Campos, Cassio Polpo de; Rocha, José Carlos Ferreira da
Source: International Journal of Approximate Reasoning. Unidade: EP
Subjects: LÓGICA, REDES NEURAIS, TEORIA DOS GRAFOS, PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e CAMPOS, Cassio Polpo de e ROCHA, José Carlos Ferreira da. Probabilistic logic with independence. International Journal of Approximate Reasoning, v. 49, n. 1, p. 03 -17, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2007.08.002. Acesso em: 11 jun. 2024.
APA
Cozman, F. G., Campos, C. P. de, & Rocha, J. C. F. da. (2008). Probabilistic logic with independence. International Journal of Approximate Reasoning, 49( 1), 03 -17. doi:10.1016/j.ijar.2007.08.002
NLM
Cozman FG, Campos CP de, Rocha JCF da. Probabilistic logic with independence [Internet]. International Journal of Approximate Reasoning. 2008 ; 49( 1): 03 -17.[citado 2024 jun. 11 ] Available from: https://doi.org/10.1016/j.ijar.2007.08.002
Vancouver
Cozman FG, Campos CP de, Rocha JCF da. Probabilistic logic with independence [Internet]. International Journal of Approximate Reasoning. 2008 ; 49( 1): 03 -17.[citado 2024 jun. 11 ] Available from: https://doi.org/10.1016/j.ijar.2007.08.002
Artigo de periodico
Computing lower and upper expectations under epistemic independence (2007)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Source: International Journal of Approximate Reasoning. Unidade: EP
Subjects: PROGRAMAÇÃO LINEAR, PROBABILIDADE, MODELOS MATEMÁTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. Computing lower and upper expectations under epistemic independence. International Journal of Approximate Reasoning, v. 44, n. 3, p. 244-260, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2006.07.013. Acesso em: 11 jun. 2024.
APA
Campos, C. P. de, & Cozman, F. G. (2007). Computing lower and upper expectations under epistemic independence. International Journal of Approximate Reasoning, 44( 3), 244-260. doi:10.1016/j.ijar.2006.07.013
NLM
Campos CP de, Cozman FG. Computing lower and upper expectations under epistemic independence [Internet]. International Journal of Approximate Reasoning. 2007 ; 44( 3): 244-260.[citado 2024 jun. 11 ] Available from: https://doi.org/10.1016/j.ijar.2006.07.013
Vancouver
Campos CP de, Cozman FG. Computing lower and upper expectations under epistemic independence [Internet]. International Journal of Approximate Reasoning. 2007 ; 44( 3): 244-260.[citado 2024 jun. 11 ] Available from: https://doi.org/10.1016/j.ijar.2006.07.013
Trabalho de evento
Multilinear and integer programming for Markov decision processes with imprecise probabilities (2007)
Shirota Filho, Ricardo; Cozman, Fabio Gagliardi ; Trevizan, Felipe Werndl; Campos, Cassio Polpo de; Barros, Leliane Nunes de
Source: ISIPTA'07 : proceedings. Conference titles: International Symposium on Imprecise Probability:Theories and Applications - ISIPTA. Unidades: EP, IME
Subjects: PROCESSOS DE MARKOV, PROBABILIDADE, PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SHIROTA FILHO, Ricardo et al. Multilinear and integer programming for Markov decision processes with imprecise probabilities. 2007, Anais.. Prague: Charles University, 2007. Disponível em: http://www.sipta.org/isipta07/proceedings/papers/s062.pdf. Acesso em: 11 jun. 2024.
APA
Shirota Filho, R., Cozman, F. G., Trevizan, F. W., Campos, C. P. de, & Barros, L. N. de. (2007). Multilinear and integer programming for Markov decision processes with imprecise probabilities. In ISIPTA'07 : proceedings. Prague: Charles University. Recuperado de http://www.sipta.org/isipta07/proceedings/papers/s062.pdf
NLM
Shirota Filho R, Cozman FG, Trevizan FW, Campos CP de, Barros LN de. Multilinear and integer programming for Markov decision processes with imprecise probabilities [Internet]. ISIPTA'07 : proceedings. 2007 ;[citado 2024 jun. 11 ] Available from: http://www.sipta.org/isipta07/proceedings/papers/s062.pdf
Vancouver
Shirota Filho R, Cozman FG, Trevizan FW, Campos CP de, Barros LN de. Multilinear and integer programming for Markov decision processes with imprecise probabilities [Internet]. ISIPTA'07 : proceedings. 2007 ;[citado 2024 jun. 11 ] Available from: http://www.sipta.org/isipta07/proceedings/papers/s062.pdf
Trabalho de evento
Independence in relational languages with finite domains (2007)
Luna, José Eduardo Ochoa; Campos, Cassio Polpo de; Cozman, Fabio Gagliardi ; Cozman, Fabio Gagliardi
Source: Anais. Conference titles: Encontro Nacional de Inteligencia Artificial. Unidade: EP
Subjects: PROBABILIDADE, ALGORITMOS, LÓGICA MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LUNA, José Eduardo Ochoa et al. Independence in relational languages with finite domains. 2007, Anais.. Rio de Janeiro: UFRJ/COPPE, 2007. Disponível em: https://repositorio.usp.br/directbitstream/95e9b4d3-ebc4-4ee9-90a2-4d6e76e23aed/Cozman-2007-Independence%20in%20Relational.pdf. Acesso em: 11 jun. 2024.
APA
Luna, J. E. O., Campos, C. P. de, Cozman, F. G., & Cozman, F. G. (2007). Independence in relational languages with finite domains. In Anais. Rio de Janeiro: UFRJ/COPPE. Recuperado de https://repositorio.usp.br/directbitstream/95e9b4d3-ebc4-4ee9-90a2-4d6e76e23aed/Cozman-2007-Independence%20in%20Relational.pdf
NLM
Luna JEO, Campos CP de, Cozman FG, Cozman FG. Independence in relational languages with finite domains [Internet]. Anais. 2007 ;[citado 2024 jun. 11 ] Available from: https://repositorio.usp.br/directbitstream/95e9b4d3-ebc4-4ee9-90a2-4d6e76e23aed/Cozman-2007-Independence%20in%20Relational.pdf
Vancouver
Luna JEO, Campos CP de, Cozman FG, Cozman FG. Independence in relational languages with finite domains [Internet]. Anais. 2007 ;[citado 2024 jun. 11 ] Available from: https://repositorio.usp.br/directbitstream/95e9b4d3-ebc4-4ee9-90a2-4d6e76e23aed/Cozman-2007-Independence%20in%20Relational.pdf
Trabalho de evento
Inference in credal networks through integer programming (2007)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Source: ISIPTA'07 : proceedings. Conference titles: International Symposium on Imprecise Probability:Theories and Applications. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, INFERÊNCIA BAYESIANA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. Inference in credal networks through integer programming. 2007, Anais.. Prague: Charles University, 2007. Disponível em: https://repositorio.usp.br/directbitstream/e494026b-7c00-44e8-9d69-3c0bd8b79ce3/Cozman-2007-Inference%20in%20credal%20networks%20through.pdf. Acesso em: 11 jun. 2024.
APA
Campos, C. P. de, & Cozman, F. G. (2007). Inference in credal networks through integer programming. In ISIPTA'07 : proceedings. Prague: Charles University. Recuperado de https://repositorio.usp.br/directbitstream/e494026b-7c00-44e8-9d69-3c0bd8b79ce3/Cozman-2007-Inference%20in%20credal%20networks%20through.pdf
NLM
Campos CP de, Cozman FG. Inference in credal networks through integer programming [Internet]. ISIPTA'07 : proceedings. 2007 ;[citado 2024 jun. 11 ] Available from: https://repositorio.usp.br/directbitstream/e494026b-7c00-44e8-9d69-3c0bd8b79ce3/Cozman-2007-Inference%20in%20credal%20networks%20through.pdf
Vancouver
Campos CP de, Cozman FG. Inference in credal networks through integer programming [Internet]. ISIPTA'07 : proceedings. 2007 ;[citado 2024 jun. 11 ] Available from: https://repositorio.usp.br/directbitstream/e494026b-7c00-44e8-9d69-3c0bd8b79ce3/Cozman-2007-Inference%20in%20credal%20networks%20through.pdf
Parte de monografia/livro
Probabilistic logic with strong independence (2006)
Cozman, Fabio Gagliardi ; Campos, Cassio Polpo de; Rocha, José Carlos Ferreira da
Source: Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. Unidade: EP
Subjects: PROBABILIDADE, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e CAMPOS, Cassio Polpo de e ROCHA, José Carlos Ferreira da. Probabilistic logic with strong independence. Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. Tradução . Berlin: Springer, 2006. . Disponível em: https://repositorio.usp.br/directbitstream/ec8bcfe3-1112-430c-a1a3-7fa0251b8f1f/Cozman-2006-Probabilistic%20Logic%20with%20Strong%20Independence.pdf. Acesso em: 11 jun. 2024.
APA
Cozman, F. G., Campos, C. P. de, & Rocha, J. C. F. da. (2006). Probabilistic logic with strong independence. In Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. Berlin: Springer. Recuperado de https://repositorio.usp.br/directbitstream/ec8bcfe3-1112-430c-a1a3-7fa0251b8f1f/Cozman-2006-Probabilistic%20Logic%20with%20Strong%20Independence.pdf
NLM
Cozman FG, Campos CP de, Rocha JCF da. Probabilistic logic with strong independence [Internet]. In: Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. Berlin: Springer; 2006. [citado 2024 jun. 11 ] Available from: https://repositorio.usp.br/directbitstream/ec8bcfe3-1112-430c-a1a3-7fa0251b8f1f/Cozman-2006-Probabilistic%20Logic%20with%20Strong%20Independence.pdf
Vancouver
Cozman FG, Campos CP de, Rocha JCF da. Probabilistic logic with strong independence [Internet]. In: Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. Berlin: Springer; 2006. [citado 2024 jun. 11 ] Available from: https://repositorio.usp.br/directbitstream/ec8bcfe3-1112-430c-a1a3-7fa0251b8f1f/Cozman-2006-Probabilistic%20Logic%20with%20Strong%20Independence.pdf
Relatorio tecnico
The inferential complexity of credal networks (2006)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Unidade: EP
Subjects: INFERÊNCIA, PROGRAMAÇÃO NÃO LINEAR, ALGORITMOS, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. The inferential complexity of credal networks. . São Paulo: EPUSP. Disponível em: https://repositorio.usp.br/directbitstream/8912e0ca-699d-4cbd-840d-29f68f380fee/Cozman-2006-inferential%20complexity-BT-PMR-0619.pdf. Acesso em: 11 jun. 2024. , 2006
APA
Campos, C. P. de, & Cozman, F. G. (2006). The inferential complexity of credal networks. São Paulo: EPUSP. Recuperado de https://repositorio.usp.br/directbitstream/8912e0ca-699d-4cbd-840d-29f68f380fee/Cozman-2006-inferential%20complexity-BT-PMR-0619.pdf
NLM
Campos CP de, Cozman FG. The inferential complexity of credal networks [Internet]. 2006 ;[citado 2024 jun. 11 ] Available from: https://repositorio.usp.br/directbitstream/8912e0ca-699d-4cbd-840d-29f68f380fee/Cozman-2006-inferential%20complexity-BT-PMR-0619.pdf
Vancouver
Campos CP de, Cozman FG. The inferential complexity of credal networks [Internet]. 2006 ;[citado 2024 jun. 11 ] Available from: https://repositorio.usp.br/directbitstream/8912e0ca-699d-4cbd-840d-29f68f380fee/Cozman-2006-inferential%20complexity-BT-PMR-0619.pdf
Trabalho de evento
Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities (2005)
Kikuti, Daniel; Cozman, Fabio Gagliardi ; Campos, Cassio Polpo de
Source: Proceedings. Conference titles: IJCAI Workshop on Advances on Preference Handling. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, INFERÊNCIA BAYESIANA, PROBABILIDADE, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KIKUTI, Daniel e COZMAN, Fabio Gagliardi e CAMPOS, Cassio Polpo de. Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities. 2005, Anais.. Edinburgh: University of Edinburgh, 2005. Disponível em: https://repositorio.usp.br/directbitstream/28628149-2277-4101-aef9-52ba5bd345e1/Cozman-2005-Partially%20ordered%20preferences%20in%20decision%20trees.pdf. Acesso em: 11 jun. 2024.
APA
Kikuti, D., Cozman, F. G., & Campos, C. P. de. (2005). Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities. In Proceedings. Edinburgh: University of Edinburgh. Recuperado de https://repositorio.usp.br/directbitstream/28628149-2277-4101-aef9-52ba5bd345e1/Cozman-2005-Partially%20ordered%20preferences%20in%20decision%20trees.pdf
NLM
Kikuti D, Cozman FG, Campos CP de. Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities [Internet]. Proceedings. 2005 ;[citado 2024 jun. 11 ] Available from: https://repositorio.usp.br/directbitstream/28628149-2277-4101-aef9-52ba5bd345e1/Cozman-2005-Partially%20ordered%20preferences%20in%20decision%20trees.pdf
Vancouver
Kikuti D, Cozman FG, Campos CP de. Partially ordered preferences in decision trees: computing strategies with imprecision in probabilities [Internet]. Proceedings. 2005 ;[citado 2024 jun. 11 ] Available from: https://repositorio.usp.br/directbitstream/28628149-2277-4101-aef9-52ba5bd345e1/Cozman-2005-Partially%20ordered%20preferences%20in%20decision%20trees.pdf
Tese (Doutorado)
Redes credais e qualitativas: complexidade e algoritmos (2005)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi (Orientador)
Unidade: EP
Subjects: INFERÊNCIA, PROGRAMAÇÃO NÃO LINEAR, ALGORITMOS, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Cassio Polpo de. Redes credais e qualitativas: complexidade e algoritmos. 2005. Tese (Doutorado) – Universidade de São Paulo, São Paulo, 2005. Disponível em: https://www.teses.usp.br/teses/disponiveis/3/3132/tde-30012024-114639/pt-br.php. Acesso em: 11 jun. 2024.
APA
Campos, C. P. de. (2005). Redes credais e qualitativas: complexidade e algoritmos (Tese (Doutorado). Universidade de São Paulo, São Paulo. Recuperado de https://www.teses.usp.br/teses/disponiveis/3/3132/tde-30012024-114639/pt-br.php
NLM
Campos CP de. Redes credais e qualitativas: complexidade e algoritmos [Internet]. 2005 ;[citado 2024 jun. 11 ] Available from: https://www.teses.usp.br/teses/disponiveis/3/3132/tde-30012024-114639/pt-br.php
Vancouver
Campos CP de. Redes credais e qualitativas: complexidade e algoritmos [Internet]. 2005 ;[citado 2024 jun. 11 ] Available from: https://www.teses.usp.br/teses/disponiveis/3/3132/tde-30012024-114639/pt-br.php
Trabalho de evento
The inferential complexity of bayesian and credal networks (2005)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Source: IJICAI-05 : proceedings. Conference titles: International Joint Conference Artificial Intelligence. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, INFERÊNCIA BAYESIANA, PROBABILIDADE, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. The inferential complexity of bayesian and credal networks. 2005, Anais.. Edinburgh: University of Edinburgh, 2005. Disponível em: http://www.ijcai.org/papers/0841.pdf. Acesso em: 11 jun. 2024.
APA
Campos, C. P. de, & Cozman, F. G. (2005). The inferential complexity of bayesian and credal networks. In IJICAI-05 : proceedings. Edinburgh: University of Edinburgh. Recuperado de http://www.ijcai.org/papers/0841.pdf
NLM
Campos CP de, Cozman FG. The inferential complexity of bayesian and credal networks [Internet]. IJICAI-05 : proceedings. 2005 ;[citado 2024 jun. 11 ] Available from: http://www.ijcai.org/papers/0841.pdf
Vancouver
Campos CP de, Cozman FG. The inferential complexity of bayesian and credal networks [Internet]. IJICAI-05 : proceedings. 2005 ;[citado 2024 jun. 11 ] Available from: http://www.ijcai.org/papers/0841.pdf

USP Schools

ReP

Filtros

Document Types

Authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Indexado em

Non normalized affiliation