Computing, School of
School of Computing: Conference and Workshop Papers
Accessibility Remediation
If you are unable to use this item in its current form due to accessibility barriers, you may request remediation through our remediation request form.
Date of this Version
2005
Document Type
Article
Abstract
1. Interchangeability: An algorithm for computing interchangeability in non-binary CSPs.
2. Dynamic bundling: Integration of the above with backtrack search for solving non-binary CSPs.
3. Experiments demonstrating the benefits of dynamic bundling
·Finding multiple, robust solutions.
·Decreasing computational cost of search.
Comments
Lal, Choueiry & Freuder in Proceedings of the National Conference on Artificial Intelligence (AAAI 2005, Pittsburgh, Pennsylvania). Pages 397-404. Copyright 2005, AAAI. Used by permission.