Sciweavers

227 search results - page 6 / 46
» An investigation of hyper-heuristic search spaces
Sort
View
ICASSP
2011
IEEE
13 years 8 days ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
ICALP
2003
Springer
14 years 1 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
14 years 25 days ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella
INFOSCALE
2006
ACM
14 years 2 months ago
A picture of search
We survey many of the measures used to describe and evaluate the efficiency and effectiveness of large-scale search services. These measures, herein visualized versus verbalized, ...
Greg Pass, Abdur Chowdhury, Cayley Torgeson
DISOPT
2011
210views Education» more  DISOPT 2011»
13 years 3 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider