1041 search results - page 9 / 209 » Randomizing Reductions of Search Problems |
EMO
2009
Springer
14 years 2 months ago
2009
Springer
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
ICRA
2000
IEEE
2000
IEEE
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
14 years 1 days ago
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
We consider the quantum database search problem, where we are given a function f : [N] → {0, 1}, and are required to return an x ∈ [N] (a