90 search results - page 11 / 18 » Failure Analysis in Backtrack Search for Constraint Satisfac... |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
62
Voted
AAAI
1997
14 years 10 months ago
1997
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
JAL
2008
14 years 9 months ago
2008
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
AAAI
2006
14 years 10 months ago
2006
With increasing deployment of systems involving multiple coordinating agents, there is a growing need for diagnosing coordination failures in such systems. Previous work presented...