Sciweavers

895 search results - page 87 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
CEC
2008
IEEE
15 years 5 months ago
A multi-agent based evolutionary algorithm in non-stationary environments
— In this paper, a multi-agent based evolutionary algorithm (MAEA) is introduced to solve dynamic optimization problems. The agents simulate living organism features and co-evolv...
Yang Yan, Hongfeng Wang, Dingwei Wang, Shengxiang ...
ICPPW
2005
IEEE
15 years 4 months ago
Gene Ordering in Microarray Data Using Parallel Memetic Algorithms
This paper addresses the Microarray Gene Ordering problem. It consists in ordering a set of genes, grouping together the ones with similar behavior. This behavior can be measured ...
Alexandre Mendes, Carlos Cotta, Vinícius Ga...
IJSNET
2008
115views more  IJSNET 2008»
14 years 11 months ago
Event-driven sensor deployment using self-organizing maps
: Coverage is an important optimization objective in pre and post-deployment stage of a Wireless Sensor Network (WSN). In this paper, we address the issue of placing a finite set o...
Cris Koutsougeras, Yi Liu, Rong Zheng
CVPR
2008
IEEE
16 years 1 months ago
An experimental study of employing visual appearance as a phenotype
Visual and non-visual data are often related through complex, indirect links, thus making the prediction of one from the other difficult. Examples include the partiallyunderstood ...
Lior Wolf, Yoni Donner
MFCS
2009
Springer
15 years 3 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...