498 search results - page 78 / 100 » Optimization of Genetic Operators for Scheduling Problems |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
A number of recent studies introduced meta-evolutionary strategies and successfully used them for solving problems in genetic programming. While individual results indicate possib...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
SOFSEM
2010
Springer
15 years 6 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
GECCO
2011
Springer
14 years 29 days ago
2011
Springer
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
124
click to vote
LCTRTS
2001
Springer
15 years 1 months ago
2001
Springer
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...