Loading...

Bucket brigade performance. I. Long sequences of classifiers  [1987]

Riolo, R.L.

Access the full text:

NOT AVAILABLE
Abstract
In Holland-type classifier systems the bucket brigade algorithm allocates strength ("credit") to classifiers that lead to rewards from environment. This paper presents results that show the bucket brigade algorithm basically works as designed--strength is passed down sequences of coupled classifiers from those classifiers that receive rewards directly from the environment to those that are stage setters. Results indicate it can take a fairly large number of trials for a classifier system to respond to changes in its environment by reallocating strength down competing sequences of classifiers that implement simple reflex and non-reflex behaviors. However, bridging classifiers' are shown to dramatically decrease the number of times a long sequence must be executed in order reallocate strength to all the classifiers in the sequence. Bridging classifiers also were shown to be one way to avoid problems caused by sharing classifiers across competing sequences.
Loading...

Other subjects

  • bucket brigade algorithm
  • algorithms
  • computer analysis
  • genetic models

From the journal

Genetic algorithms and their applications : proceedings of the second International Conference on Genetic Algorithms : July 28-31, 1987 at the Massachusetts Institute of Technology, Cambridge, MA

Other information

Language : English

Type : Journal Article

In AGRIS since : 2013

Start Page : 184

End Page : 195

Publisher : Hillsdale, N.J. : L. Erlhaum Associates, 1987.

All titles :

" Bucket brigade performance. I. Long sequences of classifiers "