Sciweavers

1206 search results - page 134 / 242
» Convergence analysis of online algorithms
Sort
View
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 2 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
EMMCVPR
2003
Springer
15 years 3 months ago
Asymptotic Characterization of Log-Likelihood Maximization Based Algorithms and Applications
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
Doron Blatt, Alfred O. Hero
ICCV
2003
IEEE
15 years 12 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
15 years 4 months ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li
ISBRA
2007
Springer
15 years 4 months ago
GFBA: A Biclustering Algorithm for Discovering Value-Coherent Biclusters
Clustering has been one of the most popular approaches used in gene expression data analysis. A clustering method is typically used to partition genes according to their similarity...
Xubo Fei, Shiyong Lu, Horia F. Pop, Lily R. Liang