Jun He

0000-0002-5616-4691

Other IDs:
Scopus Author ID: 36077384200

Personal Information

Biography

Publications

  • Public

    Drift conditions for estimating the first hitting times of evolutionary algorithms: International Journal of Computer Mathematics 2011

    Chen, Y. and Zou, X. and He, J., (2011). "Drift conditions for estimating the first hitting times of evolutionary algorithms", International Journal of Computer Mathematics, vol. 88, no. 1, pp. 37-50
  • Public

    Approximating covering problems by randomized search heuristics using multi-objectivemodels: Evolutionary Computation 2010

    Friedrich, T. and He, J. and Hebbinghaus, N. and Neumann, F. and Witt, C., (2010). "Approximating covering problems by randomized search heuristics using multi-objectivemodels", Evolutionary Computation, vol. 18, no. 4, pp. 617-633
  • Public

    Choosing selection pressure for wide-gap problems: Theoretical Computer Science 2010

    Chen, T. and He, J. and Chen, G. and Yao, X., (2010). "Choosing selection pressure for wide-gap problems", Theoretical Computer Science, vol. 411, no. 6, pp. 926-934
  • Public

    A comparative runtime analysis of heuristic algorithms for satisfiability problems: Artificial Intelligence 2009

    Zhou, Y. and He, J. and Nie, Q., (2009). "A comparative runtime analysis of heuristic algorithms for satisfiability problems", Artificial Intelligence, vol. 173, no. 2, pp. 240-257
  • Public

    A mixed strategy of combining evolutionary algorithms with multigrid methods: International Journal of Computer Mathematics 2009

    He, J. and Kang, L., (2009). "A mixed strategy of combining evolutionary algorithms with multigrid methods", International Journal of Computer Mathematics, vol. 86, no. 5, pp. 837-849
  • Public

    A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems: IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 2009

    Chen, T. and He, J. and Sun, G. and Chen, G. and Yao, X., (2009). "A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems", IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 39, no. 5, pp. 1092-1106
  • Public

    Analyses of simple hybrid algorithms for the vertex cover problem*: Evolutionary Computation 2009

    Friedrich, T. and He, J. and Hebbinghaus, N. and Neumann, F. and Witt, C., (2009). "Analyses of simple hybrid algorithms for the vertex cover problem*", Evolutionary Computation, vol. 17, no. 1, pp. 3-19
  • Public

    Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems: IEEE Transactions on Evolutionary Computation 2009

    Oliveto, P.S. and He, J. and Yao, X., (2009). "Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems", IEEE Transactions on Evolutionary Computation, vol. 13, no. 5, pp. 1006-1029
  • Public

    A hybrid artificial immune system and Self Organising Map for network intrusion detection: Information Sciences 2008

    Powers, S.T. and He, J., (2008). "A hybrid artificial immune system and Self Organising Map for network intrusion detection", Information Sciences, vol. 178, no. 15, pp. 3024-3042
  • Public

    A note on problem difficulty measures in black-box optimization: Classification, realizations and predictability: Evolutionary Computation 2007

    He, J. and Reeves, C. and Wit, C. and Yao, X., (2007). "A note on problem difficulty measures in black-box optimization: Classification, realizations and predictability", Evolutionary Computation, vol. 15, no. 4, pp. 435-443
  • Public

    A runtime analysis of evolutionary algorithms for constrained optimization problems: IEEE Transactions on Evolutionary Computation 2007

    Zhou, Y. and He, J., (2007). "A runtime analysis of evolutionary algorithms for constrained optimization problems", IEEE Transactions on Evolutionary Computation, vol. 11, no. 5, pp. 608-619
  • Public

    Convergence analysis of a self-adaptive multi-objective evolutionary algorithm based on grids: Information Processing Letters 2007

    Zhou, Y. and He, J., (2007). "Convergence analysis of a self-adaptive multi-objective evolutionary algorithm based on grids", Information Processing Letters, vol. 104, no. 4, pp. 117-122
  • Public

    Evolutionary programming using a mixed mutation strategy: Information Sciences 2007

    Dong, H. and He, J. and Huang, H. and Hou, W., (2007). "Evolutionary programming using a mixed mutation strategy", Information Sciences, vol. 177, no. 1, pp. 312-327
  • Public

    Fuzzy weighted sum validity function for clustering with a mixed strategy evolutionary algorithm: Tien Tzu Hsueh Pao/Acta Electronica Sinica 2007

    Dong, H.-B. and Huang, H.-K. and Zhou, C. and He, J. and Shang, W.-Q., (2007). "Fuzzy weighted sum validity function for clustering with a mixed strategy evolutionary algorithm", Tien Tzu Hsueh Pao/Acta Electronica Sinica, vol. 35, no. 5, pp. 964-970
  • Public

    Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results: International Journal of Automation and Computing 2007

    Oliveto, P.S. and He, J. and Yao, X., (2007). "Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results", International Journal of Automation and Computing, vol. 4, no. 3, pp. 281-293
  • Public

    Current developments and future directions of bio-inspired computation and implications for ecoinformatics: Ecological Informatics 2006

    Yao, X. and Liu, Y. and Li, J. and He, J. and Frayn, C., (2006). "Current developments and future directions of bio-inspired computation and implications for ecoinformatics", Ecological Informatics, vol. 1, no. 1, pp. 9-22
  • Public

    A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem: IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews 2005

    He, J. and Yao, X. and Li, J., (2005). "A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem", IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 35, no. 2, pp. 266-271
  • Public

    A study of drift analysis for estimating computation time of evolutionary algorithms: Natural Computing 2004

    He, J. and Yao, X., (2004). "A study of drift analysis for estimating computation time of evolutionary algorithms", Natural Computing, vol. 3, no. 1, pp. 21-35
  • Public

    Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching: Journal of Computer Science and Technology 2004

    He, J. and Yao, X., (2004). "Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching", Journal of Computer Science and Technology, vol. 19, no. 4, pp. 450-458
  • Public

    Towards an analytic framework for analysing the computation time of evolutionary algorithms: Artificial Intelligence 2003

    He, J. and Yao, X., (2003). "Towards an analytic framework for analysing the computation time of evolutionary algorithms", Artificial Intelligence, vol. 145, no. 1-2, pp. 59-97
  • Public

    Erratum: Drift analysis and average time complexity of evolutionary algorithms (Artificial Intelligence (2001) 127 (57-85)): Artificial Intelligence 2002

    He, J. and Yao, X., (2002). "Erratum: Drift analysis and average time complexity of evolutionary algorithms (Artificial Intelligence (2001) 127 (57-85))", Artificial Intelligence, vol. 140, no. 1-2, pp. 245-248
  • Public

    From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms: IEEE Transactions on Evolutionary Computation 2002

    He, J. and Yao, X., (2002). "From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms", IEEE Transactions on Evolutionary Computation, vol. 6, no. 5, pp. 495-511
  • Public

    Drift analysis and average time complexity of evolutionary algorithms: Artificial Intelligence 2001

    He, J. and Yao, X., (2001). "Drift analysis and average time complexity of evolutionary algorithms", Artificial Intelligence, vol. 127, no. 1, pp. 57-85
  • Public

    Solving equations by hybrid evolutionary computation techniques: IEEE Transactions on Evolutionary Computation 2000

    He, J. and Xu, J. and Yao, X., (2000). "Solving equations by hybrid evolutionary computation techniques", IEEE Transactions on Evolutionary Computation, vol. 4, no. 3, pp. 295-304
  • Public

    On the convergence rates of genetic algorithms: Theoretical Computer Science 1999

    He, J. and Kang, L., (1999). "On the convergence rates of genetic algorithms", Theoretical Computer Science, vol. 229, no. 1-2, pp. 23-39

Grants

No grants added yet

Patents

No patents added yet