Sciweavers

1927 search results - page 91 / 386
» UMDAs for dynamic optimization problems
Sort
View
120
Voted
DISOPT
2008
89views more  DISOPT 2008»
15 years 7 days ago
Group sequencing around a common due date
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...
CORR
2010
Springer
67views Education» more  CORR 2010»
14 years 11 months ago
Maintaining Virtual Areas on FPGAs using Strip Packing with Delays
—Every year the computing resources available on dynamically partially reconfigurable devices increase enormously. In the near future, we expect many applications to run on a si...
Josef Angermeier, Sándor P. Fekete, Tom Kam...
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
15 years 6 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
110
Voted
IPPS
1997
IEEE
15 years 4 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
99
Voted
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
15 years 1 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...