2828 search results - page 70 / 566 » Custom Local Search |
122
click to vote
CP
2004
Springer
15 years 6 months ago
2004
Springer
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
132
Voted
STOC
2004
ACM
16 years 2 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...
112
click to vote
WABI
2004
Springer
15 years 7 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...
111
Voted
GECCO
2010
Springer
15 years 4 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 ...
125
Voted
ICML
2005
IEEE
16 years 3 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 ...