We compare standard global IR searching with user-centric localized techniques to address the database selection problem. We conduct a series of experiments to compare the retriev...
In this paper, we propose a novel and simple fast block-matching algorithm (BMA), called adaptive rood pattern search (ARPS), which consists of two sequential search stages: 1) ini...
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Local search is a specialization of the web search that allows users to submit geographically constrained queries. However, one of the challenges for local search engines is to un...