#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2006

2017

- This year (4)
- Last 5 years (49)
- Last 10 years (63)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Liangxiao Jiang, Dianhong Wang, Zhihua Cai, Xuesong Yan
- ADMA
- 2007

- Xuesong Yan, Can Zhang, Wenjing Luo, Wei Li, Wei Chen, Hanmin Liu
- 2012

The traveling salesman problem (TSP) is one of the most widely studied NP-hard combinatorial optimization problems and traditional genetic algorithm trapped into the local minimum easily for solving this problem. Particle Swarm Optimization (PSO) algorithm was developed under the inspiration of behavior laws of bird flocks, fish schools and human… (More)

- Xuesong Yan, Qinghua Wu, Hui Li
- 2012

The traveling salesman problem (TSP)[1] is one of the most widely studied NP-hard combinatorial optimization problems. Its statement is deceptively simple, and yet it remains one of the most challenging problems in Operational Research. The simple description of TSP is: Give a shortest path that covers all cities along. Let G = (V; E) be a graph where V is… (More)

- Xuesong Yan, Qinghua Wu, Hammin
- 2012

Robot path planning is a NP problem. Traditionaloptimization methods are not very effective to solve it. Traditional genetic algorithm trapped into the local minimum easily. Therefore, based on a simple genetic algorithm and combine the base ideology of orthogonal design method then applied it to the population initialization, using the intergenerational… (More)

- Xuesong Yan, Wei Li, +4 authors Hammin Liu
- 2013

K-Nearest Neighbor (KNN) is one of the most popular algorithms for data classification. Many researchers have found that the KNN algorithm accomplishes very good performance in their experiments on different datasets. The traditional KNN text classification algorithm has limitations: calculation complexity, the performance is solely dependent on the… (More)

- Qinghua Wu, Hanmin Liu, Xuesong Yan
- IJCSM
- 2014

- Xuesong Yan, Wenjing Luo, Qinghua Wu, Victor S. Sheng
- IJWMC
- 2013

Traditional evolutionary algorithm trapped into the local minimum easily. Therefore, based on a simple evolutionary algorithm and combine the base ideology of orthogonal test then applied it to the population initialization, crossover operator, as well as the introduction of inver-over operator to prevent local convergence to form a new evolutionary… (More)

- Xuesong YAN, Qinghua WU, Hanmin LIU
- 2012

During the space electronic system in carries out the exploratory mission in the deep space, it maybe faced with kinds of violent natural environment, to electric circuit's performance, the volume, the weight and the stability proposed a higher request, the traditional circuit design method already more and more with difficulty satisfied this kind of… (More)

- Roshani Ade, P. R. Deshmukh, +18 authors Nikola Kasabov
- 2014

In this study, we validate that the incremental leaning as a technique in data mining can be used to classify the students according to their interest by conducting some aptitude test including psychometric tests on students. So that the students can get the correct carrier choice, student can learn the subject in which he/she is interested and improve… (More)