57 search results - page 9 / 12 » Backtracking the rat way |
STACS
2005
Springer
14 years 1 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 ...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
CP
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
INFOSCALE
2007
ACM
13 years 9 months ago
2007
ACM
—Due to the proliferation of WiFi access points, indoor localization methods based on WiFi signal strengths are becoming more and more attractive because they don’t require add...