Using Expectation Maximization to Find Likely Assignments for Solving CSP's

By Eric I. Hsu, M. Kitching, Fahiem Bacchus, Sheila A. McIlraith. 2007

17 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Elias Boutros Khalil
2. Bistra N. Dilkina
3. Le Song
4. Yoshua Bengio
5. George L. Nemhauser
6. Pierre Le Bodic
7. Bernhard Schölkopf
8. Kenji Fukumizu

Citations in the corpus

• Learning to Branch in Mixed Integer Programming (2016, methodology): “…a widely used online learning algorithm for Monte Carlo tree search (Koc-sis and Szepesv´ari 2006), neural nets are used to combine heuristics in single-agent search (Samadi, Felner, and Scha-effer 2008), and the EM algorithm is used for solving constraint satisfaction problems (Hsu et al. 2007).”