Sciweavers

220 search results - page 25 / 44
» DynDE: a differential evolution for dynamic optimization pro...
Sort
View
ASC
2011
13 years 2 months ago
Quality of Service constrained routing optimization using Evolutionary Computation
In this work, a novel optimization framework is proposed that allows the improvement of Quality of Service levels in TCP/IP based networks, by configuring the routing weights of ...
Miguel Rocha, Pedro Sousa, Paulo Cortez, Miguel Ri...
FUIN
2011
358views Cryptology» more  FUIN 2011»
12 years 11 months ago
Unsupervised and Supervised Learning Approaches Together for Microarray Analysis
In this article, a novel concept is introduced by using both unsupervised and supervised learning. For unsupervised learning, the problem of fuzzy clustering in microarray data as ...
Indrajit Saha, Ujjwal Maulik, Sanghamitra Bandyopa...
CEC
2005
IEEE
14 years 1 months ago
Ecology-inspired evolutionary algorithm using feasibility-based grouping for constrained optimization
When evolutionary algorithms are used for solving numerical constrained optimization problems, how to deal with the relationship between feasible and infeasible individuals can dir...
Ming Yuchi, Jong-Hwan Kim
WCNC
2010
IEEE
13 years 11 months ago
Network Selection in Heterogeneous Wireless Networks: Evolution with Incomplete Information
—Enabling users to connect to the best available network, dynamic network selection scheme is important for satisfying various quality of service (QoS) requirements, achieving se...
Kun Zhu, Dusit Niyato, Ping Wang
CEC
2010
IEEE
13 years 8 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius