1041 search results - page 14 / 209 » Randomizing Reductions of Search Problems |
PODS
2001
ACM
14 years 7 months ago
2001
ACM
The dimensionality curse has profound e ects on the effectiveness of high-dimensional similarity indexing from the performance perspective. One of the well known techniques for im...
CSCLP
2004
Springer
14 years 1 months ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
NAACL
2007
13 years 9 months ago
2007
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...