250 search results - page 13 / 50 » General variable neighborhood search for the continuous opti... |
120
click to vote
CVPR
2011
IEEE
14 years 3 months ago
2011
IEEE
Similarity search, namely, finding approximate nearest neighborhoods, is the core of many large scale machine learning or vision applications. Recently, many research results dem...
123
click to vote
COCOS
2003
Springer
15 years 5 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
102
click to vote
CP
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract— We present a unifying framework for continuous optimization and sampling. This framework is based on Gaussian Adaptation (GaA), a search heuristic developed in the late...