6 search results - page 1 / 2 » S-T Connectivity on Digraphs with a Known Stationary Distrib... |
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
CDC
2010
IEEE
12 years 12 months ago
2010
IEEE
We address the consensus-based distributed linear filtering problem, where a discrete time, linear stochastic process is observed by a network of sensors. We assume that the consen...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
ICDCS
2007
IEEE
13 years 11 months ago
2007
IEEE
— We introduce a virtual-node based mobile object tracking algorithm for mobile sensor networks, VINESTALK. The algorithm uses the Virtual Stationary Automata programming layer, ...
PE
2007
Springer
13 years 4 months ago
2007
Springer
The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference betwee...