1054 search results - page 115 / 211 » Capacitated Domination Problem |
132
Voted
SIAMCOMP
1998
15 years 2 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
157
Voted
VTC
2010
IEEE
15 years 17 days ago
2010
IEEE
Abstract--This paper analyzes the outage probability in cognitive radio networks, based on the Poisson point process model of node spatial distribution and the standard propagation...
117
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
There exist a number of high-performance Multi-Objective Evolutionary Algorithms (MOEAs) for solving MultiObjective Optimization (MOO) problems; two of the best are NSGA-II and -M...
100
Voted
ICCNMC
2005
Springer
15 years 8 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
121
Voted
TCS
2008
15 years 2 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...