TY - JFULL AU - Abdolreza Hatamlou and Yusef Farhang and Mohammad Reza Meybodi PY - 2009/3/ TI - Combining Variable Ordering Heuristics for Improving Search Algorithms Performance T2 - International Journal of Computer and Information Engineering SP - 426 EP - 429 VL - 3 SN - 1307-6892 UR - https://publications.waset.org/pdf/2235 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 26, 2009 N2 - Variable ordering heuristics are used in constraint satisfaction algorithms. Different characteristics of various variable ordering heuristics are complementary. Therefore we have tried to get the advantages of all heuristics to improve search algorithms performance for solving constraint satisfaction problems. This paper considers combinations based on products and quotients, and then a newer form of combination based on weighted sums of ratings from a set of base heuristics, some of which result in definite improvements in performance. ER -