Diophantine benchmarks for the B-cell algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4163 LNCS, Issue , 2006, Pages 267-279

  Bull, P ^a   Knowles, A ^b   Tedesco, G ^c   Hone, A ^d  

^a ABERYSTWYTH UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF YORK   (United Kingdom)

^c UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^d UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; CELLS; CLONING; IMMUNOLOGY; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

B-CELL ALGORITHM (BCA); BENCHMARK OPTIMISATION; BENCHMARK PROBLEMS; DIOPHANTINE EQUATIONS;

EVOLUTIONARY ALGORITHMS;

EID: 33751016800     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11823940_21     Document Type: Conference Paper

References (26)

1. [Andrews 2006] Andrews, P. Private communication (2006); opt-aiNet code available at http://www.elec.york.ac.uk/ARTIST/code.php
2. [Burger 2000] Burger, E. Exploring the Number Jungle: a Journey into Diophantine Analysis. Providence, RI, American Mathematical Society (2000).
3. [de Castro and Timmis 2002a] de Castro, L and Timmis, J. An Artificial Immune Network for Multimodal Function Optimisation, in Proceedings of IEEE World Congress on Evolutionary Computation (2002) 669-674.
4. [de Castro and Timmis 2002b] de Castro, L and Timmis, J. Artificial Immune Systems: A New Computational Intelligence Approach. Springer-Verlag (2002).
5. [Clark et al. 2005] Clark, E., Hone, A., and Timmis, J. A Markov Chain Model of the B-Cell Algorithm, in Proceedings of ICARIS 2005, C. Jacob et al. (Eds.). Springer LNCS 3627 Springer-Verlag (2005) 318-330.
6. [Dasgupta and McGregor 1992] Dasgupta, D. and McGregor, D.R. Nonstationary Function Optimization using the Structured Genetic Algorithm, Parallel Problem Solving from Nature 2 (Proc. 2nd Int. Conf. on Parallel Problem Solving from Nature, Brussels 1992), pages 145-154, 1992, Amsterdam, Elsevier
7. [Dasgupta 1994] Dasgupta, D. Handling Deceptive Problems Using a different Genetic Search, in Proceedings of the First IEEE Conference on Evolutionary Computation 1994, IEEE World Congress on Computational Intelligence (1994) 807-811.
8. [De Jong 1992] DeJong, K. Are genetic algorithms function optimizers? Parallel Problem Solving from Nature 2. Proceedings of the Second Conference on Parallel Problem Solving from Nature, Brussels: North-Holland (1992) pages 3-13.
9. [Dyer et al. 2006] Dyer, M., Goldberg, L.A., Jerrum, M. and Martin, R. Markov chain comparison. Probability Surveys 3 (2006) 89-111.
10. [Gale 1991] Gale, D. The strange and surprising saga of the Somos sequences. Mathematical Intelligencer 13 (1) (1991), 40-42.
11. [Hone and Kelsey 2004] Hone, A. and Kelsey, J. Optima, extrema and artificial immune systems. In Proceedings of ICARIS 2004, G. Nicosia et al. (Eds.), Springer LNCS 3239 (2004) 80-90.
12. [Hone 2006] Hone, A.N.W. Diophantine non-integrability of a third order recurrence with the Laurent property, J. Phys. A: Math. Gen. 39 (2006) L171-L177.
13. [Hunter 2003] Hunter, J.J. Mixing Times with Applications to Perturbed Markov Chains. Preprint, Institute of Information and Mathematical Sciences, Massey University (2003).
14. [Jerrum 2005] Jerrum, M. Algorithmically feasible sampling: what are the limits? Talk at London Mathematical Society meeting, University College London, 7th October 2005.
15. [Kelsey and Timmis 2003] Kelsey, J and Timmis, J. Immune Inspired Somatic Contiguous Hypermutation for Function Optimisation. Lecture Notes in Computer Science 2723 Cantu-Paz et al. (Eds.) Proc. of Genetic and Evolutionary Computation Conference (GECCO) 2003, 207-218.
16. [Kelsey et al. 2003] Kelsey, J., Timmis, J. and Hone, A. Chasing Chaos. In R. Sarker et al. (Eds.), Proceedings of the Congress on Evolutionary Computation, Canberra, Australia, December 2003. IEEE, pages 413-419.
17. [Kelsey 2006] Kelsey, J. Private communication (2006).
18. [Krishnakumar 1989] Krishnalumar, K. Micro-genetic algorithms for stationary and non-stationary function optimization. In SPIE Proceedings: Intelligent Control and Adaptive Systems, pages 289-296.
19. [Lamlum 1999] Lamlurn, H, et. al. The type of somatic mutation at APC in familial adenomatous polyposis is determined by the site of the germlirie mutation: a new facet to Knudson's 'two-hit' hypothesis. Nature Medicine, 1999, 5: pages 1071-1075.
20. [Lydyard et al. 2004] Lydyard, P., Whelan, A. and Fanger, M. Immunology. 2nd edition; New York, Abingdon: Taylor & Francis (2004).
21. [Manin and Panchishkin 2005] Manin, Y.I. and Panchishkin, A.A. Introduction to Modern Number Theory. 2nd edition; Berlin, Heidelberg, New York: Springer (2005).
22. [Mordell 1969] Mordell, L.J. Diophantine Equations. London: Academic Press (1969).
23. [Timmis and Edmonds 2004] Timmis, J. and Edmonds, C. A Comment on opt-AiNET: An Immune Network Algorithm for Optimisation, in Genetic and Evolutionary Computation, D. Kalyanmoy et al. (Eds.). Springer LNCS 3102 Springer-Verlag (2004) 308-317.
24. [Villalobos et al. 2004] Villalobos-Arias, M. Coello Coello, C.A. & Hernandez-Lerma, O. Convergence analysis of a multiobjective artificial immune systems algorithm, in Proceedings of ICARIS 2004, G. Nicosia et al. (Eds.). Springer LNCS 3239 Springer-Verlag (2004) 226-235.
25. [Vose 1995] Vose, M.D. Modeling simple genetic algorithms. Evolutionary Computation 3, number 4 (1996) 453-472.
26. [Zagier 1982] Zagier, D. On the Number of Markoff Numbers Below a Given Bound. Mathematics of Computation 39, number 160 (1982) 709-723.