Sciweavers

555 search results - page 64 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
15 years 1 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
GG
2010
Springer
14 years 10 months ago
Multi-Amalgamation in Adhesive Categories
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
Ulrike Golas, Hartmut Ehrig, Annegret Habel
KES
2008
Springer
14 years 9 months ago
Functional genetic programming and exhaustive program search with combinator expressions
Using a strongly typed functional programming language for genetic programming has many advantages, but evolving functional programs with variables requires complex genetic operat...
Forrest Briggs, Melissa O'Neill
WMPI
2004
ACM
15 years 3 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
ICFP
2000
ACM
15 years 2 months ago
Functional programming in C++
This paper describes FC++: a rich library supporting functional programming in C++. Prior approaches to encoding higher order functions in C++ have suffered with respect to polymo...
Brian McNamara, Yannis Smaragdakis