2365 search results - page 33 / 473 » All things are connected |
MOBICOM
2009
ACM
15 years 7 months ago
2009
ACM
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
104
click to vote
INFOCOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
104
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
CSCW
1998
ACM
15 years 5 months ago
1998
ACM
We designed HyperMirror to provide a new video image that presents an attractive, highly understandable communication environment, rather than imitating face-toface communication....
100
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
: Since no fusion theory neither rule fully satisfy all needed applications, the author proposes a Unification of Fusion Theories and a combination of fusion rules in solving probl...