Sciweavers

4229 search results - page 398 / 846
» On the Optimality of Spiral Search
Sort
View
196
Voted
COLOGNETWENTE
2010
15 years 3 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
TEC
2010
120views more  TEC 2010»
15 years 1 months ago
Benefits of a Population: Five Mechanisms That Advantage Population-Based Algorithms
This paper identifies five distinct mechanisms by which a population-based algorithm might have an advantage over a solo-search algorithm in classical optimization. These mechanism...
Adam Prügel-Bennett
185
Voted
CIKM
2008
Springer
15 years 8 months ago
Modeling LSH for performance tuning
Although Locality-Sensitive Hashing (LSH) is a promising approach to similarity search in high-dimensional spaces, it has not been considered practical partly because its search q...
Wei Dong, Zhe Wang, William Josephson, Moses Chari...
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 10 months ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noisy BBOB-2010 testbed
The Covariance-Matrix-Adaptation Evolution-Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD . Recently, ...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
181
Voted
CHI
2006
ACM
16 years 7 months ago
Fast, flexible filtering with phlat
Systems for fast search of personal information are rapidly becoming ubiquitous. Such systems promise to dramatically improve personal information management, yet most are modeled...
Edward Cutrell, Daniel C. Robbins, Susan T. Dumais...