메뉴 건너뛰기




Volumn 6825 LNCS, Issue , 2011, Pages 117-131

On the analysis of the immune-inspired B-cell algorithm for the vertex cover problem

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; B-CELL ALGORITHMS; NP-HARD; POPULATION SIZES; RUNTIMES; SEARCH HEURISTICS; SOMATIC HYPERMUTATION; VERTEX COVER PROBLEMS; WORST CASE;

EID: 79960380349     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22371-6_13     Document Type: Conference Paper
Times cited : (36)

References (19)
  • 1
    • 26944496764 scopus 로고    scopus 로고
    • A markov chain model of the B-cell algorithm
    • Jacob, C., Pilat, M.L., Bentley, P.J., Timmis, J.I. (eds.) ICARIS 2005. Springer, Heidelberg
    • Clark, E., Hone, A., Timmis, J.: A markov chain model of the B-cell algorithm. In: Jacob, C., Pilat, M.L., Bentley, P.J., Timmis, J.I. (eds.) ICARIS 2005. LNCS, vol. 3627, pp. 318-330. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3627 , pp. 318-330
    • Clark, E.1    Hone, A.2    Timmis, J.3
  • 2
    • 24644504274 scopus 로고    scopus 로고
    • Exploring the capability of immune algorithms: A characterization of hypermutation operators
    • Nicosia, G., Cutello, V., Bentley, P.J., Timmis, J. (eds.) ICARIS 2004. Springer, Heidelberg
    • Cutello, V., Nicosia, G., Pavone, M.: Exploring the capability of immune algorithms: A characterization of hypermutation operators. In: Nicosia, G., Cutello, V., Bentley, P.J., Timmis, J. (eds.) ICARIS 2004. LNCS, vol. 3239, pp. 263-276. Springer, Heidelberg (2004)
    • (2004) LNCS , vol.3239 , pp. 263-276
    • Cutello, V.1    Nicosia, G.2    Pavone, M.3
  • 4
    • 0036613006 scopus 로고    scopus 로고
    • Learning and optimization using the clonal selection principle
    • de Castro, L., Zuben, F.: Learning and optimization using the clonal selection principle. IEEE T. on Evol. Comp. 6(3), 239-251 (2002)
    • (2002) IEEE T. on Evol. Comp. , vol.6 , Issue.3 , pp. 239-251
    • De Castro, L.1    Zuben, F.2
  • 5
    • 29844440416 scopus 로고    scopus 로고
    • On the hardness of approximating vertex cover
    • Dinur, I., Safra, S.: On the hardness of approximating vertex cover. A. of Mathematics 162(1), 439-485 (2005)
    • (2005) A. of Mathematics , vol.162 , Issue.1 , pp. 439-485
    • Dinur, I.1    Safra, S.2
  • 7
    • 0037029331 scopus 로고    scopus 로고
    • On the analysis of the (1+1) evolutionary algorithm
    • Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276(51), 51-81 (2002)
    • (2002) Theoretical Computer Science , vol.276 , Issue.51 , pp. 51-81
    • Droste, S.1    Jansen, T.2    Wegener, I.3
  • 8
    • 33745050688 scopus 로고    scopus 로고
    • Upper and lower bounds for randomized search heuristics in black-box optimization
    • Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Comp. Sys. 39(4), 525-544 (2006)
    • (2006) Theory of Comp. Sys. , vol.39 , Issue.4 , pp. 525-544
    • Droste, S.1    Jansen, T.2    Wegener, I.3
  • 9
    • 78649761266 scopus 로고    scopus 로고
    • Approximating covering problems by randomized search heuristics using multi-objective models
    • Friedrich, T., Hebbinghaus, N., Neumann, F., He, J., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models. Evol. Comp. 18(4), 617-633 (2010)
    • (2010) Evol. Comp. , vol.18 , Issue.4 , pp. 617-633
    • Friedrich, T.1    Hebbinghaus, N.2    Neumann, F.3    He, J.4    Witt, C.5
  • 10
    • 78651270822 scopus 로고    scopus 로고
    • Analyzing different variants of immune inspired somatic contiguous hypermutations
    • Jansen, T., Zarges, C.: Analyzing different variants of immune inspired somatic contiguous hypermutations. Theoretical Computer Science 412(6), 517-533 (2011)
    • (2011) Theoretical Computer Science , vol.412 , Issue.6 , pp. 517-533
    • Jansen, T.1    Zarges, C.2
  • 11
    • 76649088030 scopus 로고    scopus 로고
    • A better approximation ratio for the vertex cover problem
    • Karakostas, G.: A better approximation ratio for the vertex cover problem. ACM Trans. on Algorithms 5(4), 41:1-41:8 (2009)
    • (2009) ACM Trans. on Algorithms , vol.5 , Issue.4
    • Karakostas, G.1
  • 12
    • 35248889916 scopus 로고    scopus 로고
    • Immune inspired somatic contiguous hypermutation for function optimisation
    • Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O'Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. Springer, Heidelberg
    • Kelsey, J., Timmis, J.: Immune inspired somatic contiguous hypermutation for function optimisation. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O'Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 207-218. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2724 , pp. 207-218
    • Kelsey, J.1    Timmis, J.2
  • 14
    • 55749090951 scopus 로고    scopus 로고
    • Analysis of population-based evolutionary algorithms for the vertex cover problem
    • Oliveto, P.S., He, J., Yao, X.: Analysis of population-based evolutionary algorithms for the vertex cover problem. In: Proc. of CEC 2008 (WCCI 2008), pp. 1563-1570 (2008)
    • (2008) Proc. of CEC 2008 (WCCI 2008) , pp. 1563-1570
    • Oliveto, P.S.1    He, J.2    Yao, X.3
  • 15
    • 70349866664 scopus 로고    scopus 로고
    • Analysis of the (1+1)-EA for finding approximate solutions to vertex cover problems
    • Oliveto, P.S., He, J., Yao, X.: Analysis of the (1+1)-EA for finding approximate solutions to vertex cover problems. IEEE T. Evol. Comp. 13(5), 1006-1029 (2009)
    • (2009) IEEE T. Evol. Comp. , vol.13 , Issue.5 , pp. 1006-1029
    • Oliveto, P.S.1    He, J.2    Yao, X.3
  • 16
    • 84889801446 scopus 로고    scopus 로고
    • Representations for Genetic and Evol
    • Springer, Heidelberg
    • Rothlauf, F.: Representations for Genetic and Evol. Algorithms. Springer, Heidelberg (2006)
    • (2006) Algorithms
    • Rothlauf, F.1
  • 17
    • 61449195995 scopus 로고    scopus 로고
    • On some properties of the B-cell algorithm in non-stationary environments
    • Springer, Heidelberg
    • Trojanowski, K., Wierzchoń, S.: On some properties of the B-cell algorithm in non-stationary environments. In: Advances in Information Processing and Protection, pp. 35-44. Springer, Heidelberg (2008)
    • (2008) Advances in Information Processing and Protection , pp. 35-44
    • Trojanowski, K.1    Wierzchoń, S.2
  • 18
    • 56449094644 scopus 로고    scopus 로고
    • Rigorous runtime analysis of inversely fitness proportional mutation rates
    • Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. Springer, Heidelberg
    • Zarges, C.: Rigorous runtime analysis of inversely fitness proportional mutation rates. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 112-122. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5199 , pp. 112-122
    • Zarges, C.1
  • 19
    • 70349085245 scopus 로고    scopus 로고
    • On the utility of the population size for inversely fitness proportional mutation rates
    • Zarges, C.: On the utility of the population size for inversely fitness proportional mutation rates. In: Proc. of FOGA 2009, pp. 39-46 (2009)
    • (2009) Proc. of FOGA 2009 , pp. 39-46
    • Zarges, C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.