Sciweavers

1628 search results - page 15 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 2 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
FOGA
1994
13 years 8 months ago
Predictive Models Using Fitness Distributions of Genetic Operators
An important goal of the theory of genetic algorithms is to build predictive models of how well genetic algorithms are expected to perform, given a representation, a fitness lands...
John J. Grefenstette
ICIP
2005
IEEE
14 years 9 months ago
Level set curve evolution partitioning of polarimetric images
We investigate a method of segmentation of multichannel polarimetric images, such as in laser illuminated or synthetic aperture radar, into a given but arbitrary number of regions...
Ismail Ben Ayed, Amar Mitiche, Ziad Belhadj
ISBRA
2007
Springer
14 years 1 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
DIS
2006
Springer
13 years 11 months ago
A Novel Framework for Discovering Robust Cluster Results
We propose a novel method, called heterogeneous clustering ensemble (HCE), to generate robust clustering results that combine multiple partitions (clusters) derived from various cl...
Hye-Sung Yoon, Sang-Ho Lee, Sung-Bum Cho, Ju Han K...