An empirical study of probabilistic arc consistency as a variable ordering heuristic

DOI10.1007/3-540-45349-0_43MaRDI QIDQ4473055zbMATH OpenFDO

Authors Michael C. Horsch, William S. Havens

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1894/18940525.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Experimental studies of variable selection strategies based on constraint weights
• Evaluating and improving modern variable and revision ordering strategies in CSPs
• Neighborhood-based variable ordering heuristics for the constraint satisfaction problem
• Counting-based search: branching heuristics for constraint satisfaction problems
• Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems

Cited in

(5)

• A non-binary constraint ordering heuristic for constraint satisfaction problems
• Evaluating and improving modern variable and revision ordering strategies in CSPs
• Using Four Cost Measures to Determine Arc Reversal Orderings
• Experimental studies of variable selection strategies based on constraint weights
• The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems

This page was built for publication: An empirical study of probabilistic arc consistency as a variable ordering heuristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473055)