Searching for authors named "Shengxiang Yang" – sorted by Relevance.
-
Evolutionary Algorithms for Dynamic Optimization Problems: Workshop Preface
- -2005) 26 June 2005, Washington DC, USA edited by Shengxiang Yang, University of Leicester, United
- Add To MetaCart
-
Dual Population-Based Incremental Learning for Problem Optimization in Dynamic Environments
- Shengxiang Yang 1 , Xin Yao 2 In recent years there is a growing interest in the research of evolutionary
- Cited by 2 (0 self) – Add To MetaCart
-
Population-based incremental learning with memory scheme for changing environments
- -Based Incremental Learning With Associative Memory for Dynamic Environments Shengxiang Yang, Member, IEEE, and Xin
- Cited by 4 (3 self) – Add To MetaCart
-
Hyper-learning for population-based incremental learning in dynamic environments
- Hyper-Learning for Population-Based Incremental Learning in Dynamic Environments Shengxiang Yang
- Cited by 2 (2 self) – Add To MetaCart
-
A Clustering Particle Swarm Optimizer for Dynamic Optimization
- A Clustering Particle Swarm Optimizer for Dynamic Optimization Changhe Li and Shengxiang Yang
- Add To MetaCart
-
An Adaptive Learning Particle Swarm Optimizer for Function Optimization
- An Adaptive Learning Particle Swarm Optimizer for Function Optimization Changhe Li and Shengxiang
- Add To MetaCart
-
Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks
- Routing Problems in Mobile Ad Hoc Networks Shengxiang Yang, Member, IEEE, Hui Cheng, and Fang Wang, Member
- Add To MetaCart
-
This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART C: APPLICATIONS AND REVIEWS 1 Genetic Algorithms With
- Routing Problems in Mobile Ad Hoc Networks Shengxiang Yang, Member, IEEE, Hui Cheng, and Fang Wang, Member
- Add To MetaCart
-
A Sequence Based Genetic Algorithm with Local Search for the Travelling Salesman Problem
- Arshad, Shengxiang Yang, and Changhe Li Department of Computer Science University of Leicester Leicester
- Add To MetaCart
-
Genetic Algorithms with Elitism-based Immigrants for Dynamic Shortest Path Problem in Mobile Ad Hoc Networks
- Hoc Networks Hui Cheng, Shengxiang Yang Member, IEEE Abstract— In recent years, the static shortest
- Add To MetaCart

