Sciweavers

368 search results - page 14 / 74
» Reusing Code in Genetic Programming
Sort
View
ICCS
2004
Springer
14 years 3 months ago
Platform-Independent Cache Optimization by Pinpointing Low-Locality Reuse
Abstract. For many applications, cache misses are the primary performance bottleneck. Even though much research has been performed on automatically optimizing cache behavior at the...
Kristof Beyls, Erik H. D'Hollander
ICLP
1997
Springer
14 years 1 months ago
A Practical Approach to Structure Reuse of Arrays in Single Assignment Languages
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
Andreas Kågedal, Saumya K. Debray
GECCO
2006
Springer
215views Optimization» more  GECCO 2006»
14 years 1 months ago
A multi-chromosome approach to standard and embedded cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the for...
James Alfred Walker, Julian Francis Miller, Rachel...
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
14 years 4 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
ISPASS
2008
IEEE
14 years 4 months ago
Pinpointing and Exploiting Opportunities for Enhancing Data Reuse
—The potential for improving the performance of data-intensive scientific programs by enhancing data reuse in cache is substantial because CPUs are significantly faster than me...
Gabriel Marin, John M. Mellor-Crummey