Chao Qian
标题引用次数年份
Pareto ensemble pruning
C Qian, Y Yu, ZH Zhou
Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015
652015
An analysis on recombination in multi-objective evolutionary optimization
C Qian, Y Yu, ZH Zhou
Artificial Intelligence 204, 99-119, 2013
642013
Subset selection by Pareto optimization
C Qian, Y Yu, ZH Zhou
Advances in Neural Information Processing Systems, 1774-1782, 2015
632015
On the effectiveness of sampling for evolutionary optimization in noisy environments
C Qian, Y Yu, K Tang, Y Jin, X Yao, ZH Zhou
Evolutionary computation 26 (2), 237-267, 2018
39*2018
Analyzing evolutionary optimization in noisy environments
C Qian, Y Yu, ZH Zhou
Evolutionary computation 26 (1), 1-41, 2018
292018
Selection hyper-heuristics can provably be helpful in evolutionary multi-objective optimization
C Qian, K Tang, ZH Zhou
International Conference on Parallel Problem Solving from Nature, 835-846, 2016
272016
Parallel Pareto Optimization for Subset Selection.
C Qian, JC Shi, Y Yu, K Tang, ZH Zhou
IJCAI, 1939-1945, 2016
242016
Switch analysis for running time analysis of evolutionary algorithms
Y Yu, C Qian, ZH Zhou
IEEE Transactions on Evolutionary Computation 19 (6), 777-792, 2014
242014
On constrained boolean pareto optimization
C Qian, Y Yu, ZH Zhou
Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
222015
Subset selection under noise
C Qian, JC Shi, Y Yu, K Tang, ZH Zhou
Advances in neural information processing systems, 3560-3570, 2017
202017
On Subset Selection with General Cost Constraints.
C Qian, JC Shi, Y Yu, K Tang
IJCAI 17, 2613-2619, 2017
172017
Variable solution structure can be helpful in evolutionary optimization
C Qian, Y Yu, ZH Zhou
Science China Information Sciences 58 (11), 1-17, 2015
172015
Running Time Analysis of the ($$$$)-EA for OneMax and LeadingOnes Under Bit-Wise Noise
C Qian, C Bian, W Jiang, K Tang
Algorithmica 81 (2), 749-795, 2019
152019
Constrained Monotone-Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee
C Qian, JC Shi, K Tang, ZH Zhou
IEEE Transactions on Evolutionary Computation 22 (4), 595-608, 2017
152017
Optimization based Layer-wise Magnitude-based Pruning for DNN Compression.
G Li, C Qian, C Jiang, X Lu, K Tang
IJCAI 1, 2, 2018
122018
Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection.
C Qian, Y Yu, K Tang
IJCAI, 1478-1484, 2018
102018
On algorithm-dependent boundary case identification for problem classes
C Qian, Y Yu, ZH Zhou
International Conference on Parallel Problem Solving from Nature, 62-71, 2012
102012
Running time analysis: Convergence-based analysis reduces to switch analysis
Y Yu, C Qian
2015 IEEE Congress on Evolutionary Computation (CEC), 2603-2610, 2015
92015
Efficient DNN Neuron Pruning by Minimizing Layer-wise Nonlinear Reconstruction Error.
C Jiang, G Li, C Qian, K Tang
IJCAI 2018, 2-2, 2018
82018
Towards analyzing recombination operators in evolutionary search
Y Yu, C Qian, ZH Zhou
International Conference on Parallel Problem Solving from Nature, 144-153, 2010
72010
系统目前无法执行此操作,请稍后再试。
文章 1–20