Michael J. Dent

Learn More
Forward Checking is a highly regarded search method used to solve Constraint Satisfaction Problems. This method performs a limited type of lookahead attempting to nd a failure earlier during a backtracking search. In this paper a new search method, Minimal Forward Checking, is introduced which under certain conditions performs the same amount of constraint(More)
, have recently shown how to model hard binary Constraint Satisfaction Problems (CSPs). Their model parameterizes CSPs with a global constraint tightness. This paper presents a new model which parameterizes CSPs with local constraint tightness parameters. The new model combines Smith's predictor of the transition point ^ p 2crit with local graph topology.(More)
  • 1