Learning variable ordering heuristics for solving constraint satisfaction problems
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...
Saved in:
Main Authors: | Song, Wen, Cao, Zhiguang, Zhang, Jie, Xu, Chi, Lim, Andrew |
---|---|
其他作者: | School of Computer Science and Engineering |
格式: | Article |
語言: | English |
出版: |
2022
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/162726 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Learning variable ordering heuristics for solving constraint satisfaction problems
由: SONG, Wen, et al.
出版: (2022) -
Solving functional constraints by variable substitution
由: Zhang, Y., et al.
出版: (2013) -
BINARY ENCODINGS FOR SOLVING AD-HOC CONSTRAINTS
由: WANG RUIWEI
出版: (2023) -
Randomized approximation of the constraint satisfaction problem
由: LAU, Hoong Chuin, et al.
出版: (1996) -
Erratum: P. van Beek and R. Dechter's theorem on constraint looseness and local consistency (Journal of the ACM)
由: Zhang, Y., et al.
出版: (2013)