In the database context, the hypertree decomposition method is used for query optimization,
whereby conjunctive queries having a low degree of cyclicity can be recognized and …

This article presents the state-of-the-art in optimal solution methods for decentralized
partially observable Markov decision processes (Dec-POMDPs), which are general models …

Motivation: The use of dense single nucleotide polymorphism (SNP) data in genetic linkage
analysis of large pedigrees is impeded by significant technical, methodological and …

Finding multiple high-quality plans is essential in many planning applications, and top-k
planning asks for finding the k best plans, naturally extending cost-optimal classical …

arxiv:1412.5075v1 [cs.DS] 16 Dec 2014 Page 1 arxiv:1412.5075v1 [cs.DS] 16 Dec 2014 K-Best
Enumeration David Eppstein∗ Abstract We survey k-best enumeration problems and the …

We study the problem of regret minimization in Multi-Agent Multi-Armed Bandits (MAMABs)
where the rewards are defined through a factor graph. We derive an instance-specific regret …

We study the sensitivity of a MAP configuration of a discrete probabilistic graphical model
with respect to perturbations of its parameters. These perturbations are global, in the sense …

Computing the constant Z that normalizes an arbitrary distribution into a probability
distribution is a difficult problem that has applications in statistics, biophysics and …

Much effort has been directed at algorithms for obtaining the highest probability
configuration in a probabilistic random field model known as the maximum a posteriori …

Finding diverse solutions has become important in many combinatorial search domains,
including Automated Planning, Path Planning and Constraint Programming. Much of the …