8647 search results - page 371 / 1730 » The Container Selection Problem |
142
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
To successfully search multiple coadaptive subcomponents in a solution, we developed a novel cooperative evolutionary algorithm based on a new computational multilevel selection f...
151
click to vote
COCO
2004
Springer
15 years 8 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
139
click to vote
ICDM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
136
click to vote
SIAMNUM
2010
14 years 11 months ago
2010
A Balancing Domain Decomposition Method by Constraints (BDDC) is constructed and analyzed for the Reissner-Mindlin plate bending problem discretized with MITC finite elements. This...
167
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...