744 search results - page 39 / 149 » Parallelization of Multi-objective Evolutionary Algorithms U... |
ICCS
2003
Springer
14 years 27 days ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...
CCECE
2006
IEEE
14 years 1 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
SEMCO
2007
IEEE
14 years 2 months ago
2007
IEEE
A clustering method is presented which can be applied to knowledge bases storing semantically annotated resources. The method can be used to discover groupings of structured objec...
PAMI
2011
13 years 2 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...