989 search results - page 108 / 198 » Approximating the Pareto optimal set using a reduced set of ... |
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We revisit a class of multimodal function optimizations using evolutionary algorithms reformulated into a multiobjective framework where previous implementations have nee...
NIPS
2007
13 years 9 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
Skeletonization algorithms typically decompose an object’s
silhouette into a set of symmetric parts, offering a
powerful representation for shape categorization. However,
havi...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
DMIN
2006
13 years 9 months ago
2006
Discovering hidden patterns in large sets of workforce schedules to gain insight into the potential knowledge in workforce schedules are crucial to better understanding the workfor...