Stochastic Search with Locally Clustered Targets: Learning from T Cells

Rüdiger Reischuk, Johannes Textor


Searching a space with locally clustered targets (think picking apples from trees) leads to an optimization problem: When should the searcher leave the current region, and invest the time to travel to another one? We consider here a model of such a search process: infection screening by T cells in the immune system. Taking an AIS perspective, we ask whether this model could provide insight for similar problems in computing, for example Las Vegas algorithms with expensive restarts or agent-based intrusion detection systems. The model is simple, but presents a rich phenomenology; we analytically derive the optimal behavior of a single searcher, revealing the existence of two characteristic regimes in the search parameter space. Moreover, we determine the impact of perturbations and imprecise knowledge of the search space parameters, as well as the speedup gained by searching in parallel. The results provide potential new directions for developing tools to tune stochastic search algorithms.
Original languageEnglish
Title of host publicationArtificial Immune Systems
EditorsPietro Liò, Giuseppe Nicosia, Thomas Stibor
Number of pages14
Place of PublicationBerlin, Heidelberg
PublisherSpringer Berlin Heidelberg
Publication date07.2011
ISBN (Print)978-3-642-22370-9
ISBN (Electronic)978-3-642-22371-6
Publication statusPublished - 07.2011
Event10th International Conference, ICARIS 2011 - Cambridge, United Kingdom
Duration: 18.07.201121.07.2011


Dive into the research topics of 'Stochastic Search with Locally Clustered Targets: Learning from T Cells'. Together they form a unique fingerprint.

Cite this