暂无分享,去创建一个
Xin Yao | Yang Yu | Zhi-Hua Zhou | Chao Qian | Ke Tang
[1] Frank Neumann,et al. Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2010, GECCO '12.
[2] Ujjwal Maulik,et al. A Survey of Multiobjective Evolutionary Algorithms for Data Mining: Part I , 2014, IEEE Transactions on Evolutionary Computation.
[3] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[4] Xin Yao,et al. An evolutionary clustering algorithm for gene expression microarray data analysis , 2006, IEEE Transactions on Evolutionary Computation.
[5] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[6] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[7] Carsten Witt,et al. Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models , 2007, Evolutionary Computation.
[8] Thomas Bäck,et al. Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .
[9] Martin Skutella,et al. Evolutionary Algorithms and Matroid Optimization Problems , 2007, GECCO '07.
[10] Gregory S. Hornby,et al. Automated Antenna Design with Evolutionary Algorithms , 2006 .
[11] Ingo Wegener,et al. A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs , 1998, Evolutionary Computation.
[12] Yang Yu,et al. An analysis on recombination in multi-objective evolutionary optimization , 2011, GECCO '11.
[13] Wei Chen,et al. Robust Influence Maximization , 2016, KDD.
[14] John R. Koza,et al. What's AI Done for Me Lately? Genetic Programming's Human-Competitive Results , 2003, IEEE Intell. Syst..
[15] Carsten Witt,et al. UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2004 .
[16] Laurence A. Wolsey,et al. Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..
[17] Oliver Giel,et al. Expected runtimes of a simple multi-objective evolutionary algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..
[18] Thomas Jansen,et al. Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .
[19] Yang Yu,et al. On Constrained Boolean Pareto Optimization , 2015, IJCAI.
[20] Andreas Krause,et al. Submodular Dictionary Selection for Sparse Representation , 2010, ICML.
[21] Andreas Krause,et al. Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..
[22] Anne Auger,et al. Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.
[23] Frank Neumann,et al. Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms , 2015, Evolutionary Computation.
[24] Vahab S. Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[25] Frank Neumann,et al. Computing Minimum Cuts by Randomized Search Heuristics , 2008, GECCO '08.
[26] Yang Yu,et al. Parallel Pareto Optimization for Subset Selection , 2016, IJCAI.
[27] Frank Neumann,et al. Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem , 2004, GECCO.
[28] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[29] Yaron Singer,et al. Maximization of Approximately Submodular Functions , 2016, NIPS.
[30] Frank Neumann,et al. Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem , 2004, Eur. J. Oper. Res..
[31] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[32] Maxim Sviridenko,et al. An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem , 1999, Discret. Appl. Math..
[33] Shi Li. A 1.488 approximation algorithm for the uncapacitated facility location problem , 2013, Inf. Comput..
[34] Abhimanyu Das,et al. Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection , 2011, ICML.
[35] Xin Yao,et al. On the approximation ability of evolutionary optimization with application to minimum set cover , 2010, Artif. Intell..
[36] Joseph Naor,et al. A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.