 | 2008 |
| 10 |  | Qing Zhang,
Sanyou Y. Zeng,
Rui Wang,
Hui Shi,
Guang Chen,
Lixin X. Ding,
Lishan Kang:
Constrained optimization by the evolutionary algorithm with lower dimensional crossover and gradient-based mutation.
IEEE Congress on Evolutionary Computation 2008: 273-279 |
| 9 |  | Sanyou Y. Zeng,
Guang Chen,
Rui Wang,
Hui Li,
Hui Shi,
Lixin X. Ding,
Lishan Kang:
A new technique for assessing the diversity of close-Pareto-optimal front.
IEEE Congress on Evolutionary Computation 2008: 344-349 |
| 2007 |
| 8 |  | Sanyou Y. Zeng,
Hui Shi,
Hui Li,
Guang Chen,
Lixin X. Ding,
Lishan Kang:
A lower-dimensional-search evolutionary algorithm and its application in constrained optimization problems.
IEEE Congress on Evolutionary Computation 2007: 1255-1260 |
| 7 |  | Lixin X. Ding,
Sanyou Y. Zeng:
About the Limit Behaviors of the Transition Operators Associated with EAs.
ISICA 2007: 110-119 |
| 6 |  | Sanyou Y. Zeng,
Hui Shi,
Lishan Kang,
Lixin X. Ding:
Orthogonal Dynamic Hill Climbing Algorithm: ODHC.
Evolutionary Computation in Dynamic and Uncertain Environments 2007: 79-104 |
| 2006 |
| 5 |  | Rui Liu,
Sanyou Y. Zeng,
Lixin X. Ding,
Lishan Kang,
Hui Li,
Yuping Chen,
Yong Liu,
Yueping Han:
An Efficient Multi-Objective Evolutionary Algorithm for Combinational Circuit Design.
AHS 2006: 215-221 |
| 4 |  | Sanyou Y. Zeng,
Rui Wang,
Hui Shi,
Guang Chen,
Hugo de Garis,
Lishan Kang,
Lixin X. Ding:
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design.
GECCO 2006: 1437-1438 |
| 2005 |
| 3 |  | Lixin X. Ding,
Jinghu Yu:
Some theoretical results about the computation time of evolutionary algorithms.
GECCO 2005: 1409-1415 |
| 2 |  | Sanyou Y. Zeng,
Deyou Tang,
Lishan Kang,
Shuzhen Yao,
Lixin X. Ding:
An Orthogonal Dynamic Evolutionary Algorithm with Niches.
ICNC (2) 2005: 1049-1063 |
| 2004 |
| 1 |  | Sanyou Y. Zeng,
Lishan Kang,
Lixin X. Ding:
An Orthogonal Multi-objective Evolutionary Algorithm for Multi-objective Optimization Problems with Constraints.
Evolutionary Computation 12(1): 77-98 (2004) |