6 citations · 10 across the 4 of their papers we have counts for
4 papers
Experimental Evaluation of Branching Schemes for the CSP
Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou
The search strategy of a CP solver is determined by the variable and value ordering heuristics it employs and by the branching scheme it follows. Although the effects of variable a…
Improving the Performance of maxRPC
Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou +1
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRRC…
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
Thanasis Balafoutis, Kostas Stergiou
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpose…
Adaptive Branching for Constraint Satisfaction Problems
Thanasis Balafoutis, Kostas Stergiou
The two standard branching schemes for CSPs are d-way and 2-way branching. Although it has been shown that in theory the latter can be exponentially more effective than the former,…