International journal of approximate reasoning

• 

  Año 2010, Vol. 51, Número 5

  • Generalized loopy 2U: a new algorithm for approximate inference in credal networks

    Alessandro Antonucci, Yi Sun, Cassio P. Campos, Marco Zaffalon

    págs. 474-484

    

  • Parameter estimation and model selection for mixtures of truncated exponentials

    Helge Langseth, Thomas D. Nielsen, Rafael Rumí Rodríguez, Antonio Salmerón Cerdán

    págs. 485-498

    

  • Improvements to message computation in lazy propagation

    A.L. Madsen

    págs. 499-514

    

  • Structural-EM for learning PDG models from incomplete data

    Jens D. Nielsen, Rafael Rumí Rodríguez, Antonio Salmerón Cerdán

    págs. 515-530

    

  • Logical and algorithmic properties of stable conditional independence

    Mathias Niepert, Dirk Van Gucht, Marc Gyssens

    págs. 531-543

    

  • Learning locally minimax optimal Bayesian networks

    Tomi Silander, Teemu Roos, Petri Myllymäki

    págs. 544-557

    

  • On the robustness of Bayesian networks to learning from non-conjugate sampling

    J.Q. Smith, A. Daneshkhah

    págs. 558-572

    

  • A geometric view on learning Bayesian network structures

    Milan Studený, Jirí Vomlel, Raymond Hemmecke

    págs. 573-586

    

  • A PGM framework for recursive modeling of players in simple sequential Bayesian games

    Nicolaj Sondberg Jeppesen, Finn V. Jensen

    págs. 587-599

    

  • Comparison of tightly and loosely coupled decision paradigms in multiagent expedition

    Yang Xiang, Franklin Hanshar

    págs. 600-613