Sciweavers

2393 search results - page 42 / 479
» Bounds-Consistent Local Search
Sort
View
AAAI
2000
13 years 9 months ago
Localizing Search in Reinforcement Learning
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...
Gregory Z. Grudic, Lyle H. Ungar
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Allocation of local and global search capabilities of particle in canonical PSO
This paper analyzes theoretically the exact sampling distribution of the particle swarm optimization (PSO) without any assumption imposed by all current analyses. The distribution...
Junqi Zhang, Kun Liu, Ying Tan, Xingui He
COR
2006
108views more  COR 2006»
13 years 7 months ago
Variable neighborhood search and local branching
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
MEMETIC
2010
311views more  MEMETIC 2010»
13 years 2 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer
IWINAC
2007
Springer
14 years 1 months ago
Tackling the Error Correcting Code Problem Via the Cooperation of Local-Search-Based Agents
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
Jhon Edgar Amaya, Carlos Cotta, Antonio J. Fern&aa...