ReP USP - Resultado da busca

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: 10 set. 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 set. 10 ] 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 set. 10 ] 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: 10 set. 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 set. 10 ] 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 set. 10 ] 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: 10 set. 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 set. 10 ] 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 set. 10 ] Available from: http://www.ijcai.org/papers/0841.pdf
Trabalho de evento
Belief updating and learning in semi-qualitative probabilistic networks (2005)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Source: UAI 2005: proceedings. Conference titles: Conference on Uncertainty in Artifical 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. Belief updating and learning in semi-qualitative probabilistic networks. 2005, Anais.. Edinburgh: University of Edinburgh, 2005. Disponível em: https://repositorio.usp.br/directbitstream/f198d27f-3e2f-49fb-8510-1f76728209c6/Cozman-2005-Belief%20updating%20and%20learning%20in%20semi-qualitative.pdf. Acesso em: 10 set. 2024.
APA
Campos, C. P. de, & Cozman, F. G. (2005). Belief updating and learning in semi-qualitative probabilistic networks. In UAI 2005: proceedings. Edinburgh: University of Edinburgh. Recuperado de https://repositorio.usp.br/directbitstream/f198d27f-3e2f-49fb-8510-1f76728209c6/Cozman-2005-Belief%20updating%20and%20learning%20in%20semi-qualitative.pdf
NLM
Campos CP de, Cozman FG. Belief updating and learning in semi-qualitative probabilistic networks [Internet]. UAI 2005: proceedings. 2005 ;[citado 2024 set. 10 ] Available from: https://repositorio.usp.br/directbitstream/f198d27f-3e2f-49fb-8510-1f76728209c6/Cozman-2005-Belief%20updating%20and%20learning%20in%20semi-qualitative.pdf
Vancouver
Campos CP de, Cozman FG. Belief updating and learning in semi-qualitative probabilistic networks [Internet]. UAI 2005: proceedings. 2005 ;[citado 2024 set. 10 ] Available from: https://repositorio.usp.br/directbitstream/f198d27f-3e2f-49fb-8510-1f76728209c6/Cozman-2005-Belief%20updating%20and%20learning%20in%20semi-qualitative.pdf
Trabalho de evento
Computing lower and upper expectations under epistemic independence (2005)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Source: ISIPTA'05 : proceedings. Conference titles: International Symposium on Imprecise Probabilities and their Applications. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, REDES NEURAIS, 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. Computing lower and upper expectations under epistemic independence. 2005, Anais.. Pittsburgh: Carnegie Mellon University, 2005. Disponível em: https://repositorio.usp.br/directbitstream/18eee7c8-9964-45c4-a501-c206e5499827/Cozman-2005-Computing%20lower%20and%20upper%20expectations%20under%20epistemic%20independence%20%282005%29Livro.pdf. Acesso em: 10 set. 2024.
APA
Campos, C. P. de, & Cozman, F. G. (2005). Computing lower and upper expectations under epistemic independence. In ISIPTA'05 : proceedings. Pittsburgh: Carnegie Mellon University. Recuperado de https://repositorio.usp.br/directbitstream/18eee7c8-9964-45c4-a501-c206e5499827/Cozman-2005-Computing%20lower%20and%20upper%20expectations%20under%20epistemic%20independence%20%282005%29Livro.pdf
NLM
Campos CP de, Cozman FG. Computing lower and upper expectations under epistemic independence [Internet]. ISIPTA'05 : proceedings. 2005 ;[citado 2024 set. 10 ] Available from: https://repositorio.usp.br/directbitstream/18eee7c8-9964-45c4-a501-c206e5499827/Cozman-2005-Computing%20lower%20and%20upper%20expectations%20under%20epistemic%20independence%20%282005%29Livro.pdf
Vancouver
Campos CP de, Cozman FG. Computing lower and upper expectations under epistemic independence [Internet]. ISIPTA'05 : proceedings. 2005 ;[citado 2024 set. 10 ] Available from: https://repositorio.usp.br/directbitstream/18eee7c8-9964-45c4-a501-c206e5499827/Cozman-2005-Computing%20lower%20and%20upper%20expectations%20under%20epistemic%20independence%20%282005%29Livro.pdf
Trabalho de evento
IDS: a divide-and-conquer algorithm for inference in polytree-shaped credal networks (2005)
Rocha, José Carlos Fortes da; Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Source: Anais. Conference titles: Congresso da Sociedade Brasileira de Computação. Unidade: EP
Subjects: REDES NEURAIS, INFERÊNCIA BAYESIANA, PROBABILIDADE, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROCHA, José Carlos Fortes da e CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. IDS: a divide-and-conquer algorithm for inference in polytree-shaped credal networks. 2005, Anais.. São Paulo: Sonopress-Rimo, 2005. Disponível em: https://repositorio.usp.br/directbitstream/caffe429-501a-4c13-af4e-4523d6106591/Cozman-2005-IDS-%20A%20Divide-and-Conquer%20Algorithm.pdf. Acesso em: 10 set. 2024.
APA
Rocha, J. C. F. da, Campos, C. P. de, & Cozman, F. G. (2005). IDS: a divide-and-conquer algorithm for inference in polytree-shaped credal networks. In Anais. São Paulo: Sonopress-Rimo. Recuperado de https://repositorio.usp.br/directbitstream/caffe429-501a-4c13-af4e-4523d6106591/Cozman-2005-IDS-%20A%20Divide-and-Conquer%20Algorithm.pdf
NLM
Rocha JCF da, Campos CP de, Cozman FG. IDS: a divide-and-conquer algorithm for inference in polytree-shaped credal networks [Internet]. Anais. 2005 ;[citado 2024 set. 10 ] Available from: https://repositorio.usp.br/directbitstream/caffe429-501a-4c13-af4e-4523d6106591/Cozman-2005-IDS-%20A%20Divide-and-Conquer%20Algorithm.pdf
Vancouver
Rocha JCF da, Campos CP de, Cozman FG. IDS: a divide-and-conquer algorithm for inference in polytree-shaped credal networks [Internet]. Anais. 2005 ;[citado 2024 set. 10 ] Available from: https://repositorio.usp.br/directbitstream/caffe429-501a-4c13-af4e-4523d6106591/Cozman-2005-IDS-%20A%20Divide-and-Conquer%20Algorithm.pdf

USP Schools

ReP

Filtros

Subjects

Source title

Conference titles