Statistical modelling of CSP solving algorithms performance

Mateu Piñol, Carles; Béjar Torres, Ramón; Fernàndez Camon, César

doi:https://doi.org/10.1007/11564751_99

View/Open

Postprint (266.4Kb)

Issue date

2005

Author

Mateu Piñol, Carles

Béjar Torres, Ramón

Fernàndez Camon, César

Suggested citation

Mateu Piñol, Carles; Béjar Torres, Ramón; Fernàndez Camon, César; . (2005) . Statistical modelling of CSP solving algorithms performance. Lecture Notes in Computer Science, 2005, vol. 3709, p. 861-867. https://doi.org/10.1007/11564751_99.

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.

URI

http://hdl.handle.net/10459.1/46641

DOI

https://doi.org/10.1007/11564751_99

Is part of

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

Collections

Articles publicats (Informàtica i Enginyeria Industrial) [843]