In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
Stephen Remde, Keshav P. Dahal, Peter I. Cowling, ...
Most people have long term information interests. Current Web search engines satisfy immediate information needs. Specific sites support tracking of long term interests. We prese...
In business, the retrieval of up-to-date, or fresh, information is very important. It is difficult for conventional search engines based on a centralized architecture to retrieve ...
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
We consider example-critiquing systems that help people search for their most preferred item in a large catalog. We first analyze how such systems can help users in the framework ...