output
20062013
most citedComparative study of various algorithms for the merging of parton showers and matrix elements in hadronic collisions

1k citations

Showing 2013 · cs.AIShow all

6 papers · 2 filters

cs.AI2013

Representing and Reasoning With Probabilistic Knowledge: A Bayesian Approach

Marie desJardins

PAGODA (Probabilistic Autonomous Goal-Directed Agent) is a model for autonomous learning in probabilistic domains [desJardins, 1992] that incorporates innovative techniques for usi…

cs.AI20132 cited

Learning Bayesian Networks with Local Structure

Nir Friedman, Moises Goldszmidt

In this paper we examine a novel addition to the known methods for learning Bayesian networks from data that improves the quality of the learned networks. Our approach explicitly r…

cs.AI2013556 cited

Context-Specific Independence in Bayesian Networks

Craig Boutilier, Nir Friedman, Moises Goldszmidt +1

Bayesian networks provide a language for qualitatively representing the conditional independence properties of a distribution. This allows a natural and compact representation of t…

cs.AI20138 cited

Constraining Influence Diagram Structure by Generative Planning: An Application to the Optimization of Oil Spill Response

John Mark Agosta

This paper works through the optimization of a real world planning problem, with a combination of a generative planning tool and an influence diagram solver. The problem is taken f…

cs.AI2013108 cited

Sequential Update of Bayesian Network Structure

Nir Friedman, Moises Goldszmidt

There is an obvious need for improving the performance and accuracy of a Bayesian network as new data is observed. Because of errors in model construction and changes in the dynami…

cs.AI201328 cited

Continuous Value Function Approximation for Sequential Bidding Policies

Craig Boutilier, Moises Goldszmidt, Bikash Sabata

Market-based mechanisms such as auctions are being studied as an appropriate means for resource allocation in distributed and mulitagent decision problems. When agents value resour…