1041 search results - page 93 / 209 » Randomizing Reductions of Search Problems |
TELSYS
2011
13 years 2 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
ATAL
2009
Springer
13 years 9 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
EOR
2006
13 years 8 months ago
2006
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...