Sciweavers

2457 search results - page 92 / 492
» Local Search with Bootstrapping
Sort
View
PAMI
2012
13 years 9 days ago
Aggregating Local Image Descriptors into Compact Codes
— This paper addresses the problem of large-scale image search. Three constraints have to be taken into account: search accuracy, efficiency, and memory usage. We first present...
Hervé Jégou, Florent Perronnin, Matt...
DAWAK
2005
Springer
15 years 3 months ago
Gene Expression Biclustering Using Random Walk Strategies
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
Fabrizio Angiulli, Clara Pizzuti
ISCI
2008
102views more  ISCI 2008»
14 years 9 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
14 years 11 months ago
A new memetic strategy for the numerical treatment of multi-objective optimization problems
In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry o...
Oliver Schütze, Gustavo Sanchez, Carlos A. Co...
CEC
2007
IEEE
14 years 10 months ago
Designing memetic algorithms for real-world applications using self-imposed constraints
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
Thomas Michelitsch, Tobias Wagner, Dirk Biermann, ...