作  者
期刊 & 会议
年  份
Chun-Wei Tsai 的引文(52) 排序方式:
Ant colony optimization with dual pheromone tables for clustering  
This paper presents a novel pheromone update strategy for improving the clustering results of ant colony optimization (ACO). The proposed algorithm is motivated by the observation that most of the ACO......
IEEE International Conference on Fuzzy Systems  2011
1次引用 0 0
Editorial survey: swarm intelligence for data mining  
This paper surveys the intersection of two fascinating and increasingly popular domains: swarm intelligence and data mining. Whereas data mining has been a popular academic topic for decades, swarm ......
Machine Learning  2011
2次引用 0 0
analysis with data mining and ant colony algorithm for implementing of object pool optimization  
In essence, the goal of data mining is to extract knowledge from data. Data mining is an inter-disciplinary field, whose core is at the intersection of machine learning, statistics and databases. J2ME......
International Conference on Communication Systems and Network Technologies  2011
0次引用 0 0
Minimum spanning tree based split-and-merge: A hierarchical clustering method  
Most clustering algorithms become ineffective when provided with unsuitable parameters or applied to datasets which are composed of clusters with diverse shapes, sizes, and densities. To alleviate the......
Information Sciences  2011
0次引用 0 0
Efficient greyscale image compression technique based on vector quantization  
In this paper, a novel greyscale image coding technique based on vector quantization (VQ) is proposed. In VQ, the reconstructed image quality is restricted by the codebook used in the image encoding/d......
 2011
0次引用 0 0
link based k-means clustering algorithm for information retrieval  
In the rapid development of internet technologies, search engines play a vital role in information retrieval. To provide efficient search engine to the user, Link Based Search Engine for information r......
International Conference on Recent Trends in Information Technology  2011
0次引用 0 0
Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search  
The traveling salesman problem (TSP) is a classical problem in discrete or combinatorial optimization and belongs to the NP-complete classes, which means that it may be require an infeasible process......
Applied Soft Computing  2011
0次引用 0 0
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem  
This paper introduces a new hybrid algorithmic nature inspired approach based on Honey Bees Mating Optimization for successfully solving the Euclidean Traveling Salesman Problem. The proposed algorit......
Information Sciences  2011
1次引用 0 0
A parallel immune algorithm for traveling salesman problem and its application on cold rolling scheduling  
Parallel computing provides efficient solutions for combinatorial optimization problem. However, since the communications among computing processes are rather cost-consuming, the actual parallel or d......
Information Sciences  2011
0次引用 0 0
Hybrid algorithm based on Chemical Reaction Optimization and Lin-Kernighan local search for the Traveling Salesman Problem  
Chemical Reaction Optimization (CRO) is a new heuristic optimization method mimicking the process of a chemical reaction where molecules interact with each other aiming to reach the minimum state of f......
International Conference on Natural Computation  2011
0次引用 0 0

1/6 第一页 上一页 1 2 3 4 5 6 下一页
Feedback
Feedback
Feedback
我想反馈:
排行榜