Titlebook: Computational Intelligence and Security; International Confer Yuping Wang,Yiu-ming Cheung,Hailin Liu Conference proceedings 2007 Springer-V

craving

An Improved Ant Colony System and Its Applicationw efficiency greatly restrict its application. In order to improve the performance of the algorithm, the Hybrid Ant Colony System (HACS) is presented by introducing the pheromone adjusting approach, combining ACS with saving and interchange methods, etc. Furthermore, the HACS is applied to solve the

寒冷

等待

Gene Selection Using Wilcoxon Rank Sum Test and Support Vector Machine for Cancer Classificationachine (SVM) is proposed in this paper. First, Wilcoxon rank sum test is used to select a subset. Then each selected gene is trained and tested using SVM classifier with linear kernel separately, and genes with high testing accuracy rates are chosen to form the final reduced gene subset. Leave-one-o

receptors

General Particle Swarm Optimization Based on Simulated Annealing for Multi-specification One-Dimensisional cutting stock problem is proposed. Due to the limitation of its velocity-displacement search model, particle swarm optimization (PSO) has less application on discrete and combinatorial optimization problems effectively. SA-GPSO is still based on PSO mechanism, but the new updating operator is

Invertebrate

Neuropeptides

A New Model Based Multi-objective PSO Algorithm algorithm with dynamical changed inertia weight is proposed. Meanwhile, in order to overcome the drawback that most algorithms take pareto dominance as selection strategy but do not use any preference information. A new selection strategy based on the constraint dominance principle is proposed. The

多山

A New Multi-objective Evolutionary Optimisation Algorithm: The Two-Archive Algorithmh two to four objectives only. It is unclear how well these MOEAs will perform on problems with a large number of objectives. Our preliminary study?[1] showed that performance of some MOEAs deteriorates significantly as the number of objectives increases. This paper proposes a new MOEA that performs

gospel

詼諧

駁船

A Centralized Network Design Problem with Genetic Algorithm Approach formulated as the capacitated minimum spanning tree problem (CMST). Up to now there are still no effective algorithms to solve this problem. In this paper, we present a completely new approach by using the genetic algorithms (GAs). For the adaptation to the evolutionary process, we developed a tree