Predicting optimal constraint satisfaction methods

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given the breadth of constraint satisfaction problems (CSP) and the wide variety of CSP solvers, it is often very difficult to determine a priori which solving method is best suited to a problem. This work explores the use of machine learning to predict which solving method will be most effective for a given problem. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Thompson, C. D. S. (2010). Predicting optimal constraint satisfaction methods. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6085 LNAI, pp. 401–404). https://doi.org/10.1007/978-3-642-13059-5_56

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