Multi-criteria Search Algorithm: An Efficient Approximate K-NN Algorithm for Image Retrieval

Note that, if the black and white vertices of a bipartite (2-colored) graph G can be represented by vertical and horizontal segments, respectively, satisfying conditions (i) and

In this paper, a new metaheuristic inspired by music improvisations, harmony search, is applied to solve the containers storage problem at the port. The

Stigmergic MASA can be applied to environment with or without obstacles, the agent executes the function avoid obstacle to avoid obstacles, where the agent follows in this case

Column HILS presents the profit obtained, over five runs, by our HILS algorithm, the percentual gap with the best known profit and the average computational time of five runs..

Uniformly sized chunks, however, may span arbitrarily large portions of the multi-dimensional space, depending on the density distribution of the data collection. Therefore, some of

We introduce the use of Fast Flat Histogram (FFH) method employing Wang Landau Algorithm in an adaptive noise sampling framework using Random Walk to find out the pseudo-codewords

Unité de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

Our method is based on the MS-SSIM framework which, although designed to measure image quality, is used to estimate the amount of blur and noise in a degraded image given a