Skip to main content
Conference Proceedings

Improved algorithm for finding (a,b)-super solutions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3709 LNCS 848
DOI: 10.1007/11564751_86
4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Super solutions are a mechanism to provide robustness to constraint programs. We introduce a new algorithm that exploits the similarity between a super solution and its repairs in order to do inference during search. It improves on previous methods since it is more space efficient and also faster in practice. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Hebrard, E., & Walsh, T. (2005). Improved algorithm for finding (a,b)-super solutions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, p. 848). https://doi.org/10.1007/11564751_86

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free