1927 search results - page 66 / 386 » UMDAs for dynamic optimization problems |
102
Voted
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Evolutionary problem decomposition techniques divide a complex problem into simpler subproblems, evolve individuals to produce subcomponents that solve the subproblems, and then a...
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
This paper studies the multi-objectivization of single-objective optimization problems (SOOP) using evolutionary multi-objective algorithms (EMOAs). In contrast to the single-obje...
97
Voted
CORR
2007
Springer
15 years 18 days ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
111
click to vote
PDPTA
1996
15 years 1 months ago
1996
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
119
Voted
ISCC
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....