Sciweavers

19 search results - page 3 / 4
» A Symbolic Approach to Bernstein Expansion for Program Analy...
Sort
View
LCTRTS
1998
Springer
13 years 10 months ago
Automatic Accurate Time-Bound Analysis for High-Level Languages
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence ...
Yanhong A. Liu, Gustavo Gomez
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
13 years 12 months ago
A statistical learning theory approach of bloat
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...
Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, ...
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
13 years 10 months ago
Genetic programming with primitive recursion
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
Stefan Kahrs
GECCO
2010
Springer
189views Optimization» more  GECCO 2010»
13 years 11 months ago
Knowledge mining with genetic programming methods for variable selection in flavor design
This paper presents a novel approach for knowledge mining from a sparse and repeated measures dataset. Genetic programming based symbolic regression is employed to generate multip...
Katya Vladislavleva, Kalyan Veeramachaneni, Matt B...
ICS
2004
Tsinghua U.
13 years 11 months ago
Applications of storage mapping optimization to register promotion
Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop tr...
Patrick Carribault, Albert Cohen