1054 search results - page 76 / 211 » Capacitated Domination Problem |
138
click to vote
GECCO
2007
Springer
15 years 9 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...
129
click to vote
FSTTCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
118
click to vote
MICS
2010
15 years 1 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
110
click to vote
AES
2007
Springer
15 years 3 months ago
2007
Springer
Pattern recognition is an important aspect of a dominant technology such as machine intelligence. Domain specific fuzzy-neuro models particularly for the ‘black box’ implemen...
109
click to vote
ISVC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...