Login with OpenID | Report issues

 

Author: Matthew Kitching [RDF, Bibtex, BibBase, BibGraph] has 8 publications

report error (So far 0 user(s) reported errors on this item)

Exploiting Decomposition on Constraint Problems with High Tree-Width Matthew Kitching, Fahiem Bacchus. Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-2009) 525-531 2009


Set Branching in Constraint Optimization Matthew Kitching, Fahiem Bacchus. Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-2009) 532-537 2009


Exploiting Decomposition in Constraint Optimization Problems Matthew Kitching, Fahiem Bacchus. Principles and Practice of Constraint Programming 14th International Conference CP 2008 Sydney Australia September 14-18 2008. Proceedings 478-492 2008


Symmetric Component Caching Matthew Kitching, Fahiem Bacchus. IJCAI 2007 Proceedings of the 20th International Joint Conference on Artificial Intelligence Hyderabad India January 6-12 2007 118-124 2007


Symmetric Component Caching Matthew Kitching, Fahiem Bacchus. Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-2007) 118-124 2007


Using Expectation Maximization to Find Likely Assignments for Solving CSP's Eric Hsu, Matthew Kitching, Fahiem Bacchus, Sheila A. McIlraith. Proc. of 22nd Conference on Artificial Intelligence (AAAI '07), Vancouver, Canada 2007


Using Expectation Maximization to Find Likely Assignments for Solving CSP's Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, Sheila A. McIlraith. Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-2007) 224-230 2007


Using Expectation Maximization to Find Likely Assignments for Solving CSP's Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, Sheila A. McIlraith. Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence July 22-26 2007 Vancouver British Columbia Canada 224-230 2007