1.1k citations
- Xi'an Jiaotong UniversityCN17 papers
- Middlesex University LondonGB8 papers
- Guangzhou UniversityCN5 papers
- Northwestern Polytechnical UniversityCN3 papers
- Xi'an University of Finance and EconomicsCN3 papers
- Capital Normal UniversityCN2 papers
- Harbin Engineering UniversityCN2 papers
- Shaanxi Normal UniversityCN2 papers
- Sichuan UniversityCN2 papers
- Advanced Network and Services (United States)US1 paper
- Baidu (China)CN1 paper
- Beijing Computational Science Research CenterCN1 paper
5 papers · 1 filter
Binding Number, Toughness and General Matching Extendability in Graphs
Hongliang Lu, Qinglin Yu
A connected graph with at least vertices which contains a perfect matching is -{\it extendable}, if for any two sets of disjoint independent edges an…
Why the Firefly Algorithm Works?
Xin-She Yang, Xingshi He
Firefly algorithm is a nature-inspired optimization algorithm and there have been significant developments since its appearance about ten years ago. This chapter summarizes the lat…
Iterative thresholding algorithm based on non-convex method for modified lp-norm regularization minimization
Angang Cui, Jigen Peng, Haiyang Li +2
Recently, the -norm regularization minimization problem has attracted great attention in compressed sensing. However, the -norm in problem…
Swarm Intelligence: Past, Present and Future
Xin-She Yang, Suash Deb, Yuxin Zhao +2
Many optimization problems in science and engineering are challenging to solve, and the current trend is to use swarm intelligence (SI) and SI-based algorithms to tackle such chall…
Global Convergence Analysis of the Flower Pollination Algorithm: A Discrete-Time Markov Chain Approach
Xingshi He, Xin-She Yang, Mehmet Karamanoglu +1
Flower pollination algorithm is a recent metaheuristic algorithm for solving nonlinear global optimization problems. The algorithm has also been extended to solve multiobjective op…