Sciweavers

81 search results - page 11 / 17
» Learning Probabilistic Tree Grammars for Genetic Programming
Sort
View
GECCO
2008
Springer
111views Optimization» more  GECCO 2008»
13 years 9 months ago
Multi-task code reuse in genetic programming
We propose a method of knowledge reuse between evolutionary processes that solve different optimization tasks. We define the method in the framework of tree-based genetic progra...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
13 years 9 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen
CGO
2009
IEEE
14 years 3 months ago
Automatic Feature Generation for Machine Learning Based Optimizing Compilation
Recent work has shown that machine learning can automate and in some cases outperform hand crafted compiler optimizations. Central to such an approach is that machine learning tec...
Hugh Leather, Edwin V. Bonilla, Michael O'Boyle
AHS
2007
IEEE
253views Hardware» more  AHS 2007»
14 years 2 months ago
evolFIR: Evolving redundancy-free FIR structures
Finite impulse response (FIR) structures are the most commonly used digital filters and can be found in various areas of everyday life. In this paper we introduce a novel approac...
Szilvia Zvada, Gabriella Kókai, Róbe...
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
13 years 11 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley