Author

Mateu Piñol, Carles

Béjar Torres, Ramón

Fernàndez Camon, César

Publication date

2013-09-17T16:37:17Z

2013-09-17T16:37:17Z

2005



Abstract

The goal of this work is to try to create a statistical model, based only on easily computable parameters from the CSP problem to predict runtime behaviour of the solving algorithms, and let us choose the best algorithm to solve the problem. Although it seems that the obvious choice should be MAC, experimental results obtained so far show, that with big numbers of variables, other algorithms perfom much better, specially for hard problems in the transition phase.

Document Type

article
acceptedVersion

Language

English

Subjects and keywords

CSP (Llenguatge de programació); Algorismes computacionals

Publisher

Springer

Related items

Versió postprint del document publicat a https://doi.org/10.1007/11564751_99

Lecture Notes in Computer Science, 2005, vol. 3709, p. 861-867

Rights

(c) Springer, 2005

This item appears in the following Collection(s)