Dual viewpoint heuristics for binary constraint satisfaction problems
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Phase transitions and the search problem
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
New methods to color the vertices of a graph
Communications of the ACM
Scaling Effects in the CSP Phase Transition
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Search rearrangement backtracking and polynomial average time
Artificial Intelligence
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Constraint (Logic) Programming: A Survey on Research and Applications
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
| Hi-index | 0.00 |
It has long been accepted that dynamic variable ordering heuristics outperform static orderings. But just how dynamic are dynamic variable ordering heuristics? This paper examines the behaviour of a number of heuristics, and attempts to measure the entropy of the search process at different depths in the search tree.