868 search results - page 8 / 174 » Dynamic Connectivity: Connecting to Networks and Geometry |
BROADBAND
1998
13 years 8 months ago
1998
In this paper, a method for calculating blocking experienced by dynamic multicast connections in a single link is presented. A service center at the root of a tree-type network pr...
TC
2008
13 years 7 months ago
2008
We propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include wireless sensor netwo...
ADG
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
AHS
2006
IEEE
14 years 1 months ago
2006
IEEE
Randomly connecting networks have proven to be universal computing machines. By interconnecting a set of nodes in a random way one can model very complicated non-linear dynamic sy...
TROB
2008
13 years 7 months ago
2008
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...