Sciweavers

1566 search results - page 5 / 314
» Contification Using Dominators
Sort
View
COLOGNETWENTE
2007
13 years 8 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg
SIAMJO
2002
120views more  SIAMJO 2002»
13 years 7 months ago
Dual Stochastic Dominance and Related Mean-Risk Models
We consider the problem of constructing mean{risk models which are consistent with the second degree stochastic dominance relation. By exploiting duality relations of convex analys...
Wlodzimierz Ogryczak, Andrzej Ruszczynski
CCCG
2010
13 years 8 months ago
3d local algorithm for dominating sets of unit disk graphs
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...
TCAD
1998
107views more  TCAD 1998»
13 years 7 months ago
Optimizing dominant time constant in RC circuits
— Conventional methods for optimal sizing of wires and transistors use linear resistor-capacitor (RC) circuit models and the Elmore delay as a measure of signal delay. If the RC ...
Lieven Vandenberghe, Stephen P. Boyd, Abbas A. El ...