Sciweavers

116 search results - page 22 / 24
» A new quantum behaved particle swarm optimization
Sort
View
ICASSP
2011
IEEE
14 years 5 months ago
Near-field array shape calibration
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
Shuang Wan, Pei-Jung Chung, Bernard Mulgrew
PAMI
2011
14 years 8 months ago
Approximately Global Optimization for Robust Alignment of Generalized Shapes
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
Hongsheng Li, Tian Shen, Xiaolei Huang
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
15 years 2 months ago
Evolving similarity functions for code plagiarism detection
Students are often asked to submit electronic copies of their program code as part of assessment in computer science courses. To counter code plagiarism, educational institutions ...
Victor Ciesielski, Nelson Wu, Seyed M. M. Tahaghog...
ICIC
2009
Springer
15 years 8 months ago
Ensemble Classifiers Based on Kernel PCA for Cancer Data Classification
Now the classification of different tumor types is of great importance in cancer diagnosis and drug discovery. It is more desirable to create an optimal ensemble for data analysis ...
Jin Zhou, Yuqi Pan, Yuehui Chen, Yang Liu
CEC
2010
IEEE
15 years 2 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