99 citations · 205 across the 3 of their papers we have counts for
3 papers
cs.AI2013★ 44 cited
Approximating MAP using Local Search
James D. Park, Adnan Darwiche
MAP is the problem of finding a most probable instantiation of a set of variables in a Bayesian network, given evidence. Unlike computing marginals, posteriors, and MPE (a special…
cs.AI2012★ 99 cited
MAP Complexity Results and Approximation Methods
James D. Park
MAP is the problem of finding a most probable instantiation of a set of nvariables in a Bayesian network, given some evidence. MAP appears to be a significantly harder problem than…
cs.AI2012★ 62 cited
Solving MAP Exactly using Systematic Search
James D. Park, Adnan Darwiche
MAP is the problem of finding a most probable instantiation of a set of variables in a Bayesian network given some evidence. Unlike computing posterior probabilities, or MPE (a spe…