120 search results - page 23 / 24 » Genetically designed heuristics for the bin packing problem |
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
GECCO
2009
Springer
13 years 10 months ago
2009
Springer
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...