We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege...
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...
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
Current search engines crawl the Web, download content, and digest this content locally. For multimedia content, this involves considerable volumes of data. Furthermore, this proc...
In this paper, we present the concept of Passive Distributed Indexing, a general-purpose distributed search service for mobile file sharing applications, which is based on peer-to...