An agent-based computational model of Long House Valley, in northern Arizona near Monument Valley, is described and demontrated. The model, that runs from about AD 400 to 1400, consists of artificial adaptive agents (households) who inhabit a digitized version of the Long House Valley landscape....

Following Pollack, we consider a model of analog computer which can recognize various languages in real time. We encode an input word as a point in R[super d] by composing iterated maps, and then apply inequalities to the resulting point to test for membership in the language. <p> Each class of...</p>

Extinction has been seldom considered as a relevant ingredient of neodarwinian theories. The fact, however, is that the number of species extinctions in the history of life is almost the same as the number of originations. The fossil record indicates that extinction events are patterned in some...

This report is concerned with an implementation of a family of models of complex adaptive systems called Echo models. In what follows, you will find: An Introduction to Echo; Information on how to obtain, install and run the Echo system; A description of Echo's graphical interface and...

A class of minimal models is constructed that can exhibit several salient phenomena associated with T-Cell inoculations that prevent and cure auto-immune disease. The models consist of differential equations for the magnitude of two populations, the effectors {\it E} (which cause the disease),...

The problem of protecting computer systems can be viewed generally as the problem of learning to distinguish {\it self} from {\it other}. We describe a method for change detection which is based on the gereration of T cells in the immune system. Mathematical analysis reveals computational costs...

A simple model of the emergence of pillars in termite nests (Deneubourg, 1977) is modified to include several additional features that break the homogeneity of the original model: (1) a convection air stream that drives molecules of pheromone along a given direction, (2) a net flux of...

This note contains a description of John Holland's Royal Road function, which was presented at the Fifth International Conference on Genetic Algorithms in July 1993, and posted to the Internet Genetic Algorithms mailing list in August 1993 [2].

Self-organizing maps with variable local topology are shown to constitute a reasonably good heuristic to find approximate solutions to the NP-complete k-way graph partitioning problem, where a weighted graph has to be divided into k clusters of equal size while minimizing the total weight of...