|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
ABSTRACT
In this paper we look at systems consisting of many autonomous components or agents which have only limited amount of resources (e.g. memory) but are able to communicate with each other. The aim of these systems is to solve classification problems (usually to classify binary strings). We incorporate a pittsburgh style learning classifier system into the agents and extend its possible actions by actions for passing the classification requests to other agents. We show that the system is able to overcome the limited resources of its parts by evolving cooperation between them. We take a deeper look at the structure of the generated rule sets and investigate the occurring communication patterns. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
INDEX TERMS
Primary Classification:
General Terms:
Keywords:
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||