Artificial Immune Systems: A New Computational Intelligence Paradigm
Artificial Immune Systems: A New Computational Intelligence Paradigm
Modeling simple genetic algorithms
Evolutionary Computation
Immune inspired somatic contiguous hypermutation for function optimisation
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Learning and optimization using the clonal selection principle
IEEE Transactions on Evolutionary Computation
Application areas of AIS: The past, the present and the future
Applied Soft Computing
Theoretical advances in artificial immune systems
Theoretical Computer Science
Evaluation and Extension of the AISEC Email Classification System
ICARIS '08 Proceedings of the 7th international conference on Artificial Immune Systems
Rigorous Runtime Analysis of Inversely Fitness Proportional Mutation Rates
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
On the utility of the population size for inversely fitness proportional mutation rates
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
Analyzing different variants of immune inspired somatic contiguous hypermutations
Theoretical Computer Science
On the analysis of the immune-inspired B-cell algorithm for the vertex cover problem
ICARIS'11 Proceedings of the 10th international conference on Artificial immune systems
Diophantine benchmarks for the b-cell algorithm
ICARIS'06 Proceedings of the 5th international conference on Artificial Immune Systems
On some properties of binary chromosomes and states of artificial immune systems
International Journal of Data Analysis Techniques and Strategies
Computing longest common subsequences with the B-cell algorithm
ICARIS'12 Proceedings of the 11th international conference on Artificial Immune Systems
Hi-index | 0.00 |
An exact Markov chain model of the B-cell algorithm (BCA) is constructed via a novel possible transit method. The model is used to formulate a proof that the BCA is convergent absolute under a very broad set of conditions. Results from a simple numerical example are presented, we use this to demonstrate how the model can be applied to increase understanding of the performance of the BCA in optimizing function landscapes as well as giving insight into the optimal parameter settings for the BCA.