98 search results - page 11 / 20 » Cut-and-solve: An iterative search strategy for combinatoria... |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
HM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The maximum diversity problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
PPL
2010
13 years 2 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
LION
2007
Springer
14 years 1 months ago
2007
Springer
This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered i...