4679 search results - page 23 / 936 » Modeling When Connections Are the Problem |
ISPA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper, we investigate the fault tolerance of connectivity probability for CDMA-based wireless sensor networks with variations of nodes deployment. The variations ...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
OPODIS
2004
14 years 11 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
120
click to vote
PODC
2012
ACM
13 years 6 days ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
RECOMB
2010
Springer
15 years 4 months ago
2010
Springer
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...