Learning variable ordering heuristics for solving constraint satisfaction problems

• المؤلفون الرئيسيون: Song, Wen, Cao, Zhiguang, Zhang, Jie, Xu, Chi, Lim, Andrew
• مؤلفون آخرون: School of Computer Science and Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2022
• الموضوعات: Engineering::Computer science and engineering; Constraint Satisfaction Problem; Variable Ordering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/162726
• المؤسسة: Nanyang Technological University

Backtracking search algorithms are often used to solve the Constraint Satisfaction Problem (CSP), which is widely applied in various domains such as automated planning and scheduling. The efficiency of backtracking search depends greatly on the variable ordering heuristics. Currently, the most commo...