47 search results - page 4 / 10 » Cache Diversity in Genetic Algorithm Design |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
EOR
2007
13 years 7 months ago
2007
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
EUROSYS
2009
ACM
14 years 4 months ago
2009
ACM
The backends of today’s Internet services rely heavily on caching at various layers both to provide faster service to common requests and to reduce load on back-end components. ...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...