Sciweavers

5316 search results - page 300 / 1064
» Which Search Problems Are Random
Sort
View
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
16 years 7 days ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
LION
2007
Springer
192views Optimization» more  LION 2007»
16 years 8 days ago
Learning While Optimizing an Unknown Fitness Surface
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...
Roberto Battiti, Mauro Brunato, Paolo Campigotto
GECCO
2003
Springer
137views Optimization» more  GECCO 2003»
15 years 11 months ago
The Spatially-Dispersed Genetic Algorithm
Abstract. Spatially structured population models improve the performance of genetic algorithms by assisting the selection scheme in maintaining diversity. A significant concern wi...
Grant Dick
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
16 years 8 days ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
ICDE
2007
IEEE
140views Database» more  ICDE 2007»
16 years 7 months ago
Selecting Stars: The k Most Representative Skyline Operator
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang