250 search results - page 11 / 50 » General variable neighborhood search for the continuous opti... |
181
click to vote
EOR
2008
15 years 6 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
214
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Subspace mapping methods aim at projecting high-dimensional data into a subspace where a specific objective function is optimized. Such dimension reduction allows the re...
176
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
174
click to vote
IEEEPACT
2006
IEEE
16 years 18 days ago
2006
IEEE
On machines with high-performance processors, the memory system continues to be a performance bottleneck. Compilers insert prefetch operations and reorder data accesses to improve...
181
Voted
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...