Sciweavers

57 search results - page 6 / 12
» On random walks in direction-aware network problems
Sort
View
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
14 years 4 months ago
Latency Analysis of Coalescence for Robot Groups
— Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communicat...
Sameera Poduri, Gaurav S. Sukhatme
DCOSS
2011
Springer
12 years 9 months ago
Planning the trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
Wint Yi Poe, Michael Beck, Jens B. Schmitt
STACS
2007
Springer
14 years 3 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
14 years 11 months ago
Approximating Aggregation Queries in Peer-to-Peer Networks
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Va...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 9 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...