Testing MCMC algorithms with randomly generated bayesian networks (2002)
- Authors:
- Autor USP: COZMAN, FABIO GAGLIARDI - EP
- Unidade: EP
- Subjects: REDES DE COMPUTADORES; ALGORITMOS; INTELIGÊNCIA ARTIFICIAL
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: SBIA 2002
- Conference titles: Brazilian Symposium on Artificial Intelligence
-
ABNT
IDE, Jaime Shinsuke e COZMAN, Fabio Gagliardi. Testing MCMC algorithms with randomly generated bayesian networks. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://repositorio.usp.br/directbitstream/7b90d0a4-4a74-4810-a1d4-a7a2be324e02/Cozman-2002-Testing%20MCMC%20algorithms%20with%20randomly.pdf. Acesso em: 23 abr. 2024. -
APA
Ide, J. S., & Cozman, F. G. (2002). Testing MCMC algorithms with randomly generated bayesian networks. In SBIA 2002. Berlin: Springer. Recuperado de https://repositorio.usp.br/directbitstream/7b90d0a4-4a74-4810-a1d4-a7a2be324e02/Cozman-2002-Testing%20MCMC%20algorithms%20with%20randomly.pdf -
NLM
Ide JS, Cozman FG. Testing MCMC algorithms with randomly generated bayesian networks [Internet]. SBIA 2002. 2002 ;[citado 2024 abr. 23 ] Available from: https://repositorio.usp.br/directbitstream/7b90d0a4-4a74-4810-a1d4-a7a2be324e02/Cozman-2002-Testing%20MCMC%20algorithms%20with%20randomly.pdf -
Vancouver
Ide JS, Cozman FG. Testing MCMC algorithms with randomly generated bayesian networks [Internet]. SBIA 2002. 2002 ;[citado 2024 abr. 23 ] Available from: https://repositorio.usp.br/directbitstream/7b90d0a4-4a74-4810-a1d4-a7a2be324e02/Cozman-2002-Testing%20MCMC%20algorithms%20with%20randomly.pdf - Pesquisadores da USP concluem robo móvel e vão torna-lo mais inteligente. [Depoimento]
- Inteligência Artificial no dia-a-dia [Entrevista á Fabio de Lima]
- Semisupervised learning of classifiers: theory, algorithms, and their application to human-computer interaction
- Anytime anyspace probabilistic inference
- Axiomatizing noisy-OR
- Bayesian network classifiers for country risk forecasting
- Computing lower and upper expectations under epistemic independence
- IPE and L2U: appoximate algorithms for credal networks
- Derivadas em redes bayesianas usando eliminação de variáveis
- Semi-supervised learning and model search
Download do texto completo
Tipo | Nome | Link | |
---|---|---|---|
Cozman-2002-Testing MCMC ... |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas