He Jun - Citegraph

Author Info

Name	Affiliation	Papers
HE JUN	Department of Computer Science, University of Wales, Aberystwyth, Ceredigion SY23 3DB, Wales, UK	55
Collaborators	Citations	PageRank
74	617	42.32
Referers	Referees	References
934	676	536

Search Limit

100934

Publications (55 rows)

Collaborators (74 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Average convergence rate of evolutionary algorithms in continuous optimization	2	0.36	2021
Unlimited budget analysis.	0	0.34	2019
A novel two-archive strategy for evolutionary many-objective optimization algorithm based on reference points.	0	0.34	2019
A New Framework for Analysis of Coevolutionary Systems - Directed Graph Representation and Random Walks.	0	0.34	2019
Hybrid evolutionary programming using adaptive Lévy mutation and modified Nelder–Mead method	0	0.34	2019
A Scalar Projection and Angle-Based Evolutionary Algorithm for Many-Objective Optimization Problems.	16	0.47	2019
Coevolutionary systems and PageRank.	0	0.34	2019
A New Denoising Method for UHF PD Signals Using Adaptive VMD and SSA-Based Shrinkage Method.	0	0.34	2019
Average convergence rate of evolutionary algorithms in continuous optimization	2	0.36	2018
A Matching Approach to Factor Scores Based on Online Sponsored Search Auction	0	0.34	2018
A Theoretical Framework of Approximation Error Analysis of Evolutionary Algorithms.	0	0.34	2018
Online sponsored search auction matching problem with advertiser credibility	0	0.34	2017
An initial error analysis for evolutionary algorithms.	0	0.34	2017
On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation.	6	0.45	2017
Average Drift Analysis and Population Scalability.	3	0.38	2017
The Research of Solving Inverse Problems of Complex Differential Equations.	0	0.34	2016
Feature subset selection using dynamic mixed strategy	1	0.37	2015
Multi-objective Differential Evolution with Helper Functions for Constrained Optimization.	0	0.34	2015
Performance Analysis of Evolutionary Algorithms for the Minimum Label Spanning Tree Problem	10	0.53	2014
A theoretical assessment of solution quality in evolutionary algorithms for the knapsack problem	1	0.36	2014
Genetic and Evolutionary Computation.	0	0.34	2014
A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem.	1	0.34	2014
Mixed Strategy May Outperform Pure Strategy	4	0.44	2013
Design and Analysis of an Estimation of Distribution Approximation Algorithm for Single Machine Scheduling in Uncertain Environments.	0	0.34	2013
Mixed Strategy May Outperform Pure Strategy: An Initial Study	2	0.36	2013
Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning	0	0.34	2013
A Further Generalization of the	0	0.34	2013
A further generalization of the finite-population geiringer-like theorem for pomdps to allow recombination overarbitrary set covers	1	0.36	2013
A hybrid artificial immune system and Self Organising Map for network intrusion detection	41	1.24	2012
A General Analysis of Evolutionary Algorithms for Hard and Easy Fitness Functions	0	0.34	2012
Pure Strategy or Mixed Strategy? - An Initial Comparison of Their Asymptotic Convergence Rate and Asymptotic Hitting Time.	5	0.48	2012
A mixed strategy multi-objective coevolutionary algorithm based on single-point mutation and particle swarm optimization	0	0.34	2012
Population Scalability Analysis of Abstract Population-based Random Search: Spectral Radius	2	0.45	2011
Pure strategy or mixed strategy?	6	0.51	2011
Drift conditions for estimating the first hitting times of evolutionary algorithms	4	0.40	2011
A mixed strategy for Evolutionary Programming based on local fitness landscape	11	0.62	2010
Choosing selection pressure for wide-gap problems	7	0.74	2010
A note on the first hitting time of (1 + λ) evolutionary algorithm for linear functions with boolean inputs	5	0.44	2010
Analyses of simple hybrid algorithms for the vertex cover problem.	13	0.65	2009
A comparative runtime analysis of heuristic algorithms for satisfiability problems.	10	0.54	2009
A comparison of GAs using penalizing infeasible solutions and repairing infeasible solutions on restrictive capacity knapsack problem	2	0.38	2007
Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results	102	3.96	2007
Evolutionary programming using a mixed mutation strategy	39	1.81	2007
Adaptive Wavelength Assignment Using Wavelength Spectrum Separation for Distributed Optical Networks	8	0.91	2007
A Runtime Analysis of Evolutionary Algorithms for Constrained Optimization Problems	28	1.22	2007
A comparison of GAs using penalizing infeasible solutions and repairing infeasible solutions on average capacity knapsack	3	0.50	2007
Dynamic Wavelength Assignment Using Wavelength Spectrum Separation For Crosstalk Limited Networks	10	1.06	2006
A mixed mutation strategy evolutionary programming combined with species conservation technique	2	0.45	2005
Applying genetic programming to evolve learned rules for network anomaly detection	7	0.60	2005
Customizing Dependability Attributes for Mobile Service Platforms	4	0.47	2004

1
2
50 / page