|
Search the dblp DataBase
Lixin X. Ding:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Lixin X. Ding, Jinghu Yu
Some theoretical results about the computation time of evolutionary algorithms. [Citation Graph (0, 0)][DBLP] GECCO, 2005, pp:1409-1415 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] GECCO, 2006, pp:1437-1438 [Conf]
- Sanyou Y. Zeng, Deyou Tang, Lishan Kang, Shuzhen Yao, Lixin X. Ding
An Orthogonal Dynamic Evolutionary Algorithm with Niches. [Citation Graph (0, 0)][DBLP] ICNC (2), 2005, pp:1049-1063 [Conf]
- Rui Liu, Sang-you Zeng, Lixin X. Ding, Lishan Kang, Hui Li, Yuping Chen, Yong Liu, Yueping Han
An Efficient Multi-Objective Evolutionary Algorithm for Combinational Circuit Design. [Citation Graph (0, 0)][DBLP] AHS, 2006, pp:215-221 [Conf]
- Sanyou Y. Zeng, Lishan Kang, Lixin X. Ding
An Orthogonal Multi-objective Evolutionary Algorithm for Multi-objective Optimization Problems with Constraints. [Citation Graph (0, 0)][DBLP] Evolutionary Computation, 2004, v:12, n:1, pp:77-98 [Journal]
- Lixin Ding, Sanyou Y. Zeng
About the Limit Behaviors of the Transition Operators Associated with EAs. [Citation Graph (0, 0)][DBLP] ISICA, 2007, pp:110-119 [Conf]
A lower-dimensional-search evolutionary algorithm and its application in constrained optimization problems. [Citation Graph (, )][DBLP]
Constrained optimization by the evolutionary algorithm with lower dimensional crossover and gradient-based mutation. [Citation Graph (, )][DBLP]
A new technique for assessing the diversity of close-Pareto-optimal front. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|