TY - GEN
T1 - Cluster-Specific Heuristics for Constraint Solving
AU - Polat Erdeniz, Seda
AU - Felfernig, Alexander
AU - Atas, Müslüm
AU - Tran, Thi Ngoc Trang
AU - Jeran, Michael
AU - Stettinger, Martin
PY - 2017/7/15
Y1 - 2017/7/15
N2 - In Constraint Satisfaction Problems (CSP), variable ordering heuristics help to increase efficiency. Applying an appropriate heuristic can increase the performance of CSP solvers. On the other hand, if we apply specific heuristics for similar CSPs, CSP solver performance could be further improved. Similar CSPs can be grouped into same clusters. For each cluster, appropriate heuristics can be found by applying a local search. Thus, when a new CSP is created, the corresponding cluster can be found and the pre-calculated heuristics for the cluster can be applied. In this paper, we propose a new method for constraint solving which is called Cluster Specific Heuristic (CSH). We present and evaluate our method on the basis of example CSPs.
AB - In Constraint Satisfaction Problems (CSP), variable ordering heuristics help to increase efficiency. Applying an appropriate heuristic can increase the performance of CSP solvers. On the other hand, if we apply specific heuristics for similar CSPs, CSP solver performance could be further improved. Similar CSPs can be grouped into same clusters. For each cluster, appropriate heuristics can be found by applying a local search. Thus, when a new CSP is created, the corresponding cluster can be found and the pre-calculated heuristics for the cluster can be applied. In this paper, we propose a new method for constraint solving which is called Cluster Specific Heuristic (CSH). We present and evaluate our method on the basis of example CSPs.
U2 - 10.1007/978-3-319-60042-0_3
DO - 10.1007/978-3-319-60042-0_3
M3 - Conference paper
SN - 978-3-319-60041-3
T3 - Lecture Notes in Computer Science
SP - 21
EP - 30
BT - Advances in Artificial Intelligence: From Theory to Practice. IEA/AIE 2017
PB - Springer
CY - Cham
ER -