465 search results - page 19 / 93 » Dynamic Scheduling with Genetic Programming |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Genetic Network Programming (GNP) has been proposed as a graph-based evolutionary algorithm. GNP works well especially in dynamic environments due to its graph structures. In addi...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The conversion and extension of the Incremental ParetoCoevolution Archive algorithm (IPCA) into the domain of Genetic Programming classifier evolution is presented. In order to ac...
DMIN
2006
13 years 8 months ago
2006
Clustering is the process of locating patterns in large data sets. It is an active research area that provides value to scientific as well as business applications. Practical clust...
ICDCS
2003
IEEE
14 years 21 days ago
2003
IEEE
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...