This report documents the program and the outcome of Dagstuhl Seminar 13441 “Evaluation Methodologies in Information Retrieval”, which brought together 42 participants from 11 countries. The seminar was motivated by the fact that today’s information retrieval (IR) applications can hardly be evaluated based on the classic test collection paradigm, thus there is a need for new evaluation approach...

The contributions of this paper are twofold. First, we present a new type of dictionary that is intended as a search assistance in topic-specific Web searching. The method to construct the dictionary is a general method that can be applied to any reasonable topic. The first implementation deals with climate change. The dictionary has the following new features compared to standard dictionaries ...

Generation of context profile library N = 1 million training profiles of length l = 2d+1 were generated as described in the main text and Figure 2. Each training profile is represented by a count profile cn(j, x), which specifies the counts of amino acid x ∈ {1, . . . , 20} at position j ∈ {−d, . . . , d}. These counts are obtained by multiplying the sequence profile tn(j, x) by the effective n...

The genetic algorithm is of advantages to solve an inversion of complex non-linear geophysical equations. Its multi-point searching is able to find the globally optimal solution and avoid falling into a local extremum. The searching efficiency of the genetic algorithm is a key to successfully resolve a geophysical inversion problem in a huge model space with multi-parameters. Encoding mechanism...

In this paper, we consider the problem of searching for a source that releases particles in a turbulent medium with searchers having binary sensors and limited space perception. To this aim, we extend an information-theoretic strategy, namely Mapless, to multiple searchers and demonstrate its efficiency both in simulation and robotic experiments. The search time is found to decay as 1/n for n c...

Aiming at improving the global convergence speed of bacterial colony chemotaxis (BCC) optimization algorithm, a new chaotic hybrid bacterial colony chemotaxis (CHBCC) algorithm is introduced through the technique of hybrid algorithm. By integrating elitist strategy and chaotic optimization into bacterial colony chemotaxis optimization algorithm, it greatly enhances the local searching efficienc...

This paper presents the analog macro-cell placement using the novel very fast simulated re-annealing algorithm, which is exponentially faster than the classical Cauchy or Bolzmann annealing. A slide function is applied to convert the absolute placement to relative placement, which greatly decreases the configuration space without degrading the searching opportunity. The cost function is set up ...

The only technique available for solving many important problems is searching. Since searching can be extremely costly, it is important to identify features that improve the efficiency of aearch algorithms. We compute the efficiency of simple backtracking, of an algorithm similar to backtracking except that it notices when the predicate is empty instead of noticing when it is unsatlsfiable (the...

An aggregation service (AgS) is a P2P overlay-tier whose purpose is to aggregate and optimize the searching of services and service components maintained by service providers in a P2P Service Overlay Network (SON). AgS dimensioning takes into account the AgS size, in order to allow it to adequately perform the searching when compared with P2P SON native searching mechanisms. Suitable AgS dimens...