Sciweavers

1614 search results - page 165 / 323
» Polymorphism and Genetic Programming
Sort
View
ICFP
2008
ACM
15 years 10 months ago
Scala for generic programmers
Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as `list of'. Most approaches to datatype-generic programmin...
Bruno C. D. S. Oliveira, Jeremy Gibbons
ECAI
2010
Springer
14 years 11 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave
83
Voted
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
14 years 11 months ago
Evolving sequence patterns for prediction of sub-cellular locations of eukaryotic proteins
A genetic algorithm (GA) is utilised to discover known and novel PROSITE-like sequence templates that can be used to classify the sub-cellular location of eukaryotic proteins. Whi...
Greg Paperin
ICFP
2009
ACM
15 years 10 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
14 years 11 months ago
Parsimony pressure made easy
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...
Riccardo Poli, Nicholas Freitag McPhee