8 citations · 21 across the 6 of their papers we have counts for
6 papers
Apply Ant Colony Algorithm to Search All Extreme Points of Function
Chao-Yang Pang, Hui Liu, Xia Li +2
To find all extreme points of multimodal functions is called extremum problem, which is a well known difficult issue in optimization fields. Applying ant colony optimization (ACO)…
Apply Local Clustering Method to Improve the Running Speed of Ant Colony Optimization
Chao-Yang Pang, Wei Hu, Xia Li +1
Ant Colony Optimization (ACO) has time complexity O(t*m*N*N), and its typical application is to solve Traveling Salesman Problem (TSP), where t, m, and N denotes the iteration numb…
Experiment Study of Entropy Convergence of Ant Colony Optimization
Chao-Yang Pang, Chong-Bao Wang, Ben-Qiong Hu
Ant colony optimization (ACO) has been applied to the field of combinatorial optimization widely. But the study of convergence theory of ACO is rare under general condition. In thi…
Quantum Search Algorithm for Set Operation
Chao-Yang Pang, Cong-Bao Ding, Ben-Qiong Hu
The operations of data set, such as intersection, union and complement, are the fundamental calculation in mathematics. It's very significant that designing fast algorithm for set…
Quantum Pattern Recognition of Classical Signal
Chao-Yang Pang, Cong-Bao Ding, Ben-Qiong Hu
It's the key research topic of signal processing that recognizing genuine targets real time from the disturbed signal which has giant amount of data. A quantum algorithm for patter…
Quantum Discrete Fourier Transform with Classical Output for Signal Processing
Chao-Yang Pang, Ben-Qiong Hu
Discrete Fourier transform (DFT) is the base of modern signal or information processing. 1-Dimensional fast Fourier transform (1D FFT) and 2D FFT have time complexity O(NlogN) and…