Sciweavers

2457 search results - page 9 / 492
» Local Search with Bootstrapping
Sort
View
EOR
2008
84views more  EOR 2008»
13 years 7 months ago
Complexity of local search for the p-median problem
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...
Ekaterina Alekseeva, Yury Kochetov, Alexander Plya...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 1 months ago
Quick-and-dirty ant colony optimization
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...
Paola Pellegrini, Elena Moretti
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 7 months ago
Complete Local Search with Memory
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 ...
Diptesh Ghosh, Gerard Sierksma
CEC
2005
IEEE
14 years 1 months ago
Adaptive local search parameters for real-coded memetic algorithms
AbstractThis paper presents a real-coded memetic algorithm that combines a high diversity global exploration with an adaptive local search method to the most promising individuals ...
Daniel Molina, Francisco Herrera, Manuel Lozano
ICRA
2009
IEEE
117views Robotics» more  ICRA 2009»
14 years 2 months ago
Modeling RFID signal strength and tag detection for localization and mapping
— In recent years, there has been an increasing interest within the robotics community in investigating whether Radio Frequency Identification (RFID) technology can be utilized ...
Dominik Joho, Christian Plagemann, Wolfram Burgard