95 citations · 308 across the 24 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.NE2012★ 45 cited
On the Easiest and Hardest Fitness Functions
Jun He, Tianshi Chen, Xin Yao
The hardness of fitness functions is an important research topic in the field of evolutionary computation. In theory, the study can help understanding the ability of evolutionary a…
cs.NE2012★ 4 cited
A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm
Boris Mitavskiy, Jun He
Nowadays hybrid evolutionary algorithms, i.e, heuristic search algorithms combining several mutation operators some of which are meant to implement stochastically a well known tech…