206 search results - page 20 / 42 » Random backtracking in backtrack search algorithms for satis... |
160
click to vote
AAAI
1998
15 years 7 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
186
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
109
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we propose an approach to guide search to sources of conflicts. The principle is the following: the last variable involved in the last conflict is selected in priori...
248
click to vote
PROCEDIA
2011
14 years 9 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
194
click to vote
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...