1041 search results - page 111 / 209 » Randomizing Reductions of Search Problems |
CONSTRAINTS
2006
13 years 8 months ago
2006
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
ALMOB
2006
13 years 8 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Constrained continuous optimization is still an interesting field of research. Many heuristics have been proposed in the last decade. Most of them are based on penalty functions....
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
Long queries frequently contain many extraneous terms that hinder retrieval of relevant documents. We present techniques to reduce long queries to more effective shorter ones tha...