113
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
137
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
122
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
80
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...