Heuristic Policy Analysis and Efficiency Assessment in Constraint Satisfaction Search
ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
Increasing tree search efficiency for constraint satisfaction problems
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Sampling strategies and variable selection in weighted degree heuristics
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Analysis of heuristic synergies
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
A hyperheuristic approach to select enumeration strategies in constraint programming
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
A hyperheuristic approach for dynamic enumeration strategy selection in constraint satisfaction
IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation: new challenges on bioinspired applications - Volume Part II
Using autonomous search for generating good enumeration strategy blends in constraint programming
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 0.00 |
Variable ordering heuristics that sample information before or during search in order to inform subsequent decisions have shown better performance and greater robustness than standard heuristics. One such strategy, the ''weighted degree heuristic,'' is based on weighting constraints according to their involvement in failure during search. A more recent approach uses ''random probing'' with restarting to gain information less subject to sampling bias. To date, these approaches have not been carefully analysed experimentally. In the present work, several important findings are presented, including a better delineation of the class of events that is sampled, an analysis of the importance of informed choices at the beginning of search, and a demonstration that random probing identifies sources of global contention effectively even when these are not clearly demarcated. These experiments show how empirical analysis can clarify subtle issues in the analysis of heuristic procedures for difficult search problems.