( en | de | ru )

 

Disambiguation of "Gómez-Olmedo, Manuel"

Author of the publication

copydeleteadd this publication to your clipboard
Development of the XML Digital Library from the Parliament of Andalucía for Intelligent Structured Retrieval.

, , , and . ISMIS, volume 4994 of Lecture Notes in Computer Science, page 417-423. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Manuel Páez-Gómez

Oscar Manuel Gómez Jiménez

Manuel Angel Gómez Cruz

Manuel Rodriguez Gomez

Juan Manuel Gomez

 

Other publications of authors with the same name

Binary Probability Trees for Bayesian Networks Inference., , and . ECSQARU, volume 5590 of Lecture Notes in Computer Science, page 180-191. Springer, (2009)Fast Factorisation of Probabilistic Potentials and its Application to Approximate Inference in Bayesian Networks., , , and . International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 20 (2): 223-243 (2012)Learning marginal AMP chain graphs under faithfulness revisited., and . Int. J. Approx. Reason., (2016)Learning recursive probability trees from probabilistic potentials., , , , and . Int. J. Approx. Reason., 53 (9): 1367-1387 (2012)Learning Sets of Bayesian Networks., , and . IPMU (2), volume 1238 of Communications in Computer and Information Science, page 151-164. Springer, (2020)On SPI for Evaluating Influence Diagrams., , , and . IPMU (1), volume 442 of Communications in Computer and Information Science, page 506-516. Springer, (2014)Using Binary Trees for the Evaluation of Influence Diagrams., , and . Int. J. Uncertain. Fuzziness Knowl. Based Syst., 24 (1): 59-90 (2016)Locally averaged Bayesian Dirichlet metrics for learning the structure and the parameters of Bayesian networks., , , and . Int. J. Approx. Reason., 54 (4): 526-540 (2013)Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks., , , and . Int. J. Approx. Reason., 44 (3): 261-280 (2007)Improvements to Variable Elimination and Symbolic Probabilistic Inference for evaluating Influence Diagrams., , , and . Int. J. Approx. Reason., (2016)