846 search results - page 107 / 170 » Dependent rounding and its applications to approximation alg... |
136
click to vote
AAAI
1998
15 years 7 months ago
1998
We present a noisy-OR Bayesian network model for simulation-based training, and an efficient search-based algorithm for automatic synthesis of plausible training scenarios from co...
164
click to vote
JMLR
2006
15 years 6 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
149
click to vote
ICDM
2005
IEEE
15 years 11 months ago
2005
IEEE
Many practical applications require that distance measures to be asymmetric and context-sensitive. We introduce Context-sensitive Learnable Asymmetric Dissimilarity (CLAD) measure...
183
click to vote
CG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...
194
click to vote
JMLR
2010
15 years 29 days ago
2010
Many probabilistic models introduce strong dependencies between variables using a latent multivariate Gaussian distribution or a Gaussian process. We present a new Markov chain Mo...