We present three new stopping rules for Multistart based methods. The first uses a device that enables the determination of the coverage of the bounded search domain. The second i...
Abstract. Searching for information in large rather unstructured realworld data sets is a dicult task, because the user expects immediate responses as well as high-quality search ...
Nils Weber, Lars Braubach, Alexander Pokahr, Winfr...
In Web search ranking, the expected results for some queries could vary greatly depending upon location of the user. We name such queries regional sensitive queries. Identifying r...
Srinivas Vadrevu, Ya Zhang, Belle L. Tseng, Gordon...
Web search engines respond to a query by returning more results than can be reasonably reviewed. These results typically include the title, link, and snippet of content from the t...
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...