270 search results - page 10 / 54 » Optimizing Global-Local Search Hybrids |
GECCO
2004
Springer
14 years 25 days ago
2004
Springer
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts....
CEC
2007
IEEE
13 years 9 months ago
2007
IEEE
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
BMCBI
2010
13 years 7 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
HIS
2008
13 years 9 months ago
2008
Machine scheduling is a critical problem in industries where products are custom-designed. The wide range of products, the lack of previous experiences in manufacturing, and the s...
JUCS
2008
13 years 7 months ago
2008
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...