abstract = "A family of stateful program representations in
grammar-based Genetic Programming are being compared
against their stateless counterpart in the problem of
binary classification of sequences of daily prices of a
financial asset. Empirical results suggest that
stateful classifiers learn as fast as stateless ones
but generalise better to unseen data, rendering this
form of program representation strongly appealing to
the automatic programming of technical trading rules.",
notes = "Also known as \cite{2001969} Distributed on CD-ROM at
GECCO-2011.