4744 search results - page 21 / 949 » Connected Computing |
185
click to vote
SAPIR
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at...
167
click to vote
DCOSS
2009
Springer
15 years 10 months ago
2009
Springer
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
168
click to vote
CHI
2005
ACM
16 years 6 months ago
2005
ACM
From pre-schools to high schools, at home and in museums, the educational community has embraced the use of computers as a teaching tool. Yet many institutions will simply install...
177
click to vote
PARA
2004
Springer
15 years 11 months ago
2004
Springer
This paper gives a numerical algorithm able to compute the number of path-connected components of a set S defined by nonlinear inequalities. This algorithm uses interval analysis ...
173
click to vote
FOCS
2009
IEEE
16 years 18 days ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph