17288 search results - page 2 / 3458 » Hybrid Optimizations: Which Optimization Algorithm to Use |
GECCO
2010
Springer
13 years 6 months ago
2010
Springer
TASE
2008
IEEE
13 years 4 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
HEURISTICS
2002
13 years 4 months ago
2002
Hybrid metaheuristics have received considerable interest these recent years in the field of combinatorial optimization. A wide variety of hybrid approaches have been proposed in ...
FLAIRS
2006
13 years 6 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
IBIS
2006
13 years 4 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...