1054 search results - page 41 / 211 » Capacitated Domination Problem |
118
click to vote
EUSFLAT
2007
15 years 7 months ago
2007
The information boundedness principle for rule based inference process requires that the knowledge obtained as a result of a rule should not have more information than that contai...
160
click to vote
AAAI
2010
15 years 7 months ago
2010
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
146
click to vote
ARSCOM
2007
15 years 6 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
150
click to vote
DM
2008
15 years 6 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
159
click to vote
CEC
2009
IEEE
16 years 23 days ago
2009
IEEE
—This paper proposes the plateau structure imposed by the Pareto dominance relation as a useful determinant of multiobjective metaheuristic performance. In essence, the dominance...