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...
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)...
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...
Lori L. Scarlatos, Amy Bruckman, Allison Druin, Mi...
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 ...