We consider the problem of collaborative search across a large number of digital libraries and query routing strategies in a peerto-peer (P2P) environment. Both digital libraries a...
Matthias Bender, Sebastian Michel, Christian Zimme...
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
One crucial task for e-commerce systems is to help buyers find products that not only satisfy their preferences but also reduce their search effort. Usually the amount of availa...
Search result diversification is a natural approach for tackling ambiguous queries. Nevertheless, not all queries are equally ambiguous, and hence different queries could bene...
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...