Sciweavers

2558 search results - page 140 / 512
» Analysis of Generalized Pattern Searches
Sort
View
CLEF
2010
Springer
14 years 11 months ago
DAEDALUS at LogCLEF 2010: Analyzing the Success of Search Queries
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 ...
Sara Lana-Serrano, Julio Villena-Román, Jos...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
14 years 11 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
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...
Thibaut Lust
WWW
2007
ACM
15 years 10 months ago
Efficient search engine measurements
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...
Ziv Bar-Yossef, Maxim Gurevich
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
15 years 10 months ago
Sorting and searching in the presence of memory faults (without redundancy)
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...
Irene Finocchi, Giuseppe F. Italiano
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 4 months ago
Insight knowledge in search based software testing
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...
Andrea Arcuri