A Novel Strategy of Combining Variable Ordering Heuristics for Constraint Satisfaction Problems
نویسندگان
چکیده
منابع مشابه
Toward Understanding Variable Ordering Heuristics for Constraint Satisfaction Problems
Most previous work on understanding variable ordering heuristics for constraint satisfaction problems has focused on the ability to recover from bad decisions. It has been demonstrated however that this ability cannot be the full explanation of the quality of a variable ordering heuristic [8]. In this paper, we develop a more complete framework for analyzing heuristics based on optimal policies...
متن کاملNeighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem
One of the key factors in the eeciency of backtracking algorithms is the rule they use to decide on which variable to branch next (namely, the variable ordering heuristics). In this paper, we give a formulation of dynamic variable ordering heuristics that takes into account the properties of the neighborhood of the variable.
متن کاملMulti Level Variable Ordering Heuristics for the Constraint Satisfaction Problem
The usual way for solving constraint satisfaction problems is to use a backtracking algorithm One of the key factors in its e ciency is the rule it will use to decide on which variable to branch next namely the variable ordering heuristics In this paper we attempt to give a general formulation of dynamic variable ordering heuristics that take into account the properties of the neighborhood of t...
متن کاملConstraint and Variable Ordering Heuristics for Compiling Configuration Problems
To facilitate interactive design, the solutions to configuration problems can be compiled into a decision diagram. We develop three heuristics for reducing the time and space required to do this. These heuristics are based on the distinctive clustered and hierarchical structure of the constraint graphs of configuration problems. The first heuristic attempts to limit the growth in the size of th...
متن کاملCombining Ordering Heuristics and Bundling Techniques for Solving Finite Constraint Satisfaction Problems
We investigate techniques to enhance the performance of backtrack search procedure with forward-checking (FC-BT) for finding all solutions to a finite Constraint Satisfaction Problem (CSP). We consider ordering heuristics for variables and/or values and bundling techniques based on the computation of interchangeability. While the former methods allow us to traverse the search space more effecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2859618