2558 search results - page 140 / 512 » Analysis of Generalized Pattern Searches |
172
click to vote
CLEF
2010
Springer
15 years 6 months ago
2010
Springer
This paper describes the participation of DAEDALUS at the LogCLEF task. The focus of our experiments was to study if the difference between the native language of the user and the ...
186
Voted
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
124
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...
144
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
141
Voted
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...