Sciweavers

61 search results - page 4 / 13
» Performance analysis of niching algorithms based on derandom...
Sort
View
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
14 years 1 months ago
An extended mutation concept for the local selection based differential evolution algorithm
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...
Jani Rönkkönen, Jouni Lampinen
SIGPRO
2008
151views more  SIGPRO 2008»
13 years 7 months ago
An adaptive penalized maximum likelihood algorithm
The LMS algorithm is one of the most popular learning algorithms for identifying an unknown system. Many variants of the algorithm have been developed based on different problem f...
Guang Deng, Wai-Yin Ng
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
13 years 12 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
CIS
2008
Springer
13 years 9 months ago
Cooperation Controlled Competitive Learning Approach for Data Clustering
Rival Penalized Competitive Learning (RPCL) and its variants can perform clustering analysis efficiently with the ability of selecting the cluster number automatically. Although t...
Tao Li, Wenjiang Pei, Shao-ping Wang, Yiu-ming Che...
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
13 years 12 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...