2393 search results - page 58 / 479 » Bounds-Consistent Local Search |
PPL
2010
13 years 4 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
CCCG
2010
13 years 11 months ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
SPIESR
2000
13 years 11 months ago
2000
Color object recognition methods that are based on image retrieval algorithms can handle changes of illumination via image normalization, e.g. simple color-channel-normalization1 ...
IJCAI
2001
13 years 11 months ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
ICRA
2000
IEEE
2000
IEEE
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
14 years 2 months 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, ...