We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby...
Abstract. Too much information kills information. This common statement applies to huge databases, where state of the art search engines may retrieve hundreds of very similar docum...
Yann Landrin-Schweitzer, Pierre Collet, Evelyne Lu...
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
We show how a number of novel email search features can be implemented without any kind of natural language processing (NLP) or advanced data mining. Our approach inspects the ema...
This paper presents a search architecture that combines classical search techniques with spread activation techniques applied to a semantic model of a given domain. Given an ontol...
Cristiano Rocha, Daniel Schwabe, Marcus Poggi de A...