dc.contributor.author
Mateu Piñol, Carles
dc.contributor.author
Béjar Torres, Ramón
dc.contributor.author
Fernàndez Camon, César
dc.date.accessioned
2024-12-05T22:40:15Z
dc.date.available
2024-12-05T22:40:15Z
dc.date.issued
2013-09-17T16:37:17Z
dc.date.issued
2013-09-17T16:37:17Z
dc.identifier
https://doi.org/10.1007/11564751_99
dc.identifier
http://hdl.handle.net/10459.1/46641
dc.identifier.uri
http://hdl.handle.net/10459.1/46641
dc.description.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.
dc.relation
Versió postprint del document publicat a https://doi.org/10.1007/11564751_99
dc.relation
Lecture Notes in Computer Science, 2005, vol. 3709, p. 861-867
dc.rights
(c) Springer, 2005
dc.rights
info:eu-repo/semantics/openAccess
dc.subject
CSP (Llenguatge de programació)
dc.subject
Algorismes computacionals
dc.title
Statistical modelling of CSP solving algorithms performance
