@inproceedings (langdon:1998:bloatDF,
  author =	{W. B. Langdon and R. Poli},
  title =	{Genetic Programming Bloat with Dynamic Fitness},
  booktitle =	{Proceedings of the First European Workshop on Genetic Programming},
  year =	1998,
  editor = 	{W. Banzhaf and R. Poli and M. Schoenauer and T. C. Fogarty},
  volume =	{},
  series =	{LNCS},
  pages = 	{},
  address = 	{Paris},
  publisher_address = 	{},
  month = 	{14-15 April},
  organisation ={},
  publisher = 	{Springer-Verlag},
  note =	{Forthcoming},
  email =	{W.B.Langdon@cs.bham.ac.uk},
  keywords =    {genetic algorithms, genetic programming},
  ISBN =        {},
  url =         {},
  size = 	{},
  abstract =	{ In artificial evolution individuals which perform as
 		  their parents are usually rewarded identically to
 		  their parents.  We note that Nature is more dynamic
 		  and there may be a penalty to pay for doing the same
 		  thing as your parents.  We report two sets of
 		  experiments where static fitness functions are
 		  firstly augmented by a penalty for unchanged
 		  offspring and secondly the static fitness case is
 		  replaced by randomly generated dynamic test cases.
  		  We conclude genetic programming, when evolving
 		  artificial ant control programs, is surprisingly
 		  little effected by large penalties and program
 		  growth is observed in all our experiments.
		  },
  notes =	{EuroGP'98. Based on CSRP-97-29 langdon:1997:dynbloatTR}
)