6095 search results - page 32 / 1219 » Learning in Local Search |
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
EOR
2008
13 years 8 months ago
2008
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Ant colony optimization (ACO) is a well known metaheuristic. In the literature it has been used for tackling many optimization problems. Often, ACO is hybridized with a local sear...
HEURISTICS
2002
13 years 8 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
SMC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Reinforcement learning is a framework in which an agent can learn behavior without knowledge on a task or an environment by exploration and exploitation. Striking a balance betw...