2393 search results - page 70 / 479 » Bounds-Consistent Local Search |
140
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
116
click to vote
WABI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We give an algorithm that locally improves the fit between two proteins modeled as space-filling diagrams. The algorithm defines the fit in purely geometric terms and...
116
click to vote
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
130
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
117
click to vote
AUSAI
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Methods of adaptive constraint satisfaction have recently become of interest to overcome the limitations imposed on “black-box” search algorithms by the no free lunch...