Sciweavers

5911 search results - page 1064 / 1183
» Annealing Sensor Networks
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 1 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
CORR
2010
Springer
146views Education» more  CORR 2010»
14 years 10 months ago
Multicast Outage Probability and Transmission Capacity of Multihop Wireless Networks
Multicast transmission, wherein the same packet must be delivered to multiple receivers, is an important aspect of sensor and tactical networks and has several distinctive traits ...
Chun-Hung Liu, Jeffrey G. Andrews
TASE
2008
IEEE
14 years 10 months ago
Modeling and Supervisory Control of Railway Networks Using Petri Nets
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
Alessandro Giua, Carla Seatzu
ASUNAM
2009
IEEE
14 years 7 months ago
Automatically Detecting Points of Interest and Social Networks from Tracking Positions of Avatars in a Virtual World
With hundreds of millions of users already today, virtual worlds will become an important factor in tomorrow's media landscape. In a virtual world, users are represented by s...
Frank Kappe, Bilal Zaka, Michael Steurer
SAC
2010
ACM
15 years 4 months ago
Coverage-hole trap model in target tracking using distributed relay-robot network
Target tracking is an important issue in wireless sensor network applications. In this paper, we design a Coverage-Hole Trap Model (CTM) based on a system that contains one moving...
Huawei Miao, Chia-Ching Ooi, Xiaowen Wu, Christian...
« Prev « First page 1064 / 1183 Last » Next »