Sciweavers

3244 search results - page 458 / 649
» On convex complexity measures
Sort
View
EVOW
2007
Springer
16 years 21 days ago
Unsupervised Evolutionary Segmentation Algorithm Based on Texture Analysis
Abstract. This work describes an evolutionary approach to texture segmentation, a long-standing and important problem in computer vision. The difficulty of the problem can be relat...
Cynthia B. Pérez, Gustavo Olague
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
16 years 21 days 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
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
16 years 21 days ago
Kernel based automatic clustering using modified particle swarm optimization algorithm
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
Ajith Abraham, Swagatam Das, Amit Konar
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
16 years 21 days ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
GECCO
2007
Springer
132views Optimization» more  GECCO 2007»
16 years 21 days ago
The multi-objective next release problem
This paper is concerned with the Multi-Objective Next Release Problem (MONRP), a problem in search-based requirements engineering. Previous work has considered only single objecti...
Yuanyuan Zhang, Mark Harman, S. Afshin Mansouri