1215 search results - page 127 / 243 » Application domain study of evolutionary algorithms in optim... |
108
Voted
JCP
2008
15 years 1 months ago
2008
A huge application domain, in particular, wireless and handheld devices strongly requires flexible and powerefficient hardware with high performance. This can only be achieved with...
127
click to vote
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
103
click to vote
ANTSW
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
134
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
This paper describes the development of an evolutionary algorithm called Multipopulation Cooperative Coevolutionary Programming (MCCP) that extends Genetic Programming (GP) to sea...
129
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...