1155 search results - page 21 / 231 » Continuous dynamic problem generators for evolutionary algor... |
111
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Since typical evolutionary design systems encode only a single artifact with each individual, each time the objective changes a new set of individuals must be evolved. Wh...
86
Voted
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
— This paper describes two performance measures for measuring an EMO (Evolutionary Multiobjective Optimization) algorithm’s ability to track a time-varying Paretofront in a dyn...
71
Voted
VL
2005
IEEE
15 years 6 months ago
2005
IEEE
Evolutionary algorithms (EAs) produce a vast amount of data by recurring processes, e.g., selection, recombination, or mutation, that work on populations of solutions for a speciï...
110
click to vote
ASC
2008
15 years 16 days ago
2008
Most data mining algorithms assume static behavior of the incoming data. In the real world, the situation is different and most continuously collected data streams are generated by...
CEC
2009
IEEE
15 years 5 months ago
2009
IEEE
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....