generated by bibbase.org
  2009 (2)
Exploiting Decomposition on Constraint Problems with High Tree-Width. Kitching, M.; and Bacchus, F. In IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pages 525-531, 2009.
Exploiting Decomposition on Constraint Problems with High Tree-Width [pdf]Link   link   bibtex  
Set Branching in Constraint Optimization. Kitching, M.; and Bacchus, F. In IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pages 532-537, 2009.
Set Branching in Constraint Optimization [pdf]Link   link   bibtex  
  2008 (1)
Exploiting Decomposition in Constraint Optimization Problems. Kitching, M.; and Bacchus, F. In Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings, pages 478-492, 2008.
Exploiting Decomposition in Constraint Optimization Problems [link]Link   link   bibtex  
  2007 (2)
Using Expectation Maximization to Find Likely Assignments for Solving CSP's. Hsu, E. I.; Kitching, M.; Bacchus, F.; and McIlraith, S. A. In Proc. of 22nd Conference on Artificial Intelligence (AAAI '07), Vancouver, Canada, 2007.
Using Expectation Maximization to Find Likely Assignments for Solving CSP's [pdf]Paper   link   bibtex  
Symmetric Component Caching. Kitching, M.; and Bacchus, F. In Proc. of the 20th International Joint Conference on Artificial Intelligence (IJCAI '07), Hyderabad, India, 2007.
link   bibtex