Sciweavers

2116 search results - page 111 / 424
» On Probabilistic Alternating Simulations
Sort
View
INFOCOM
2010
IEEE
14 years 8 months ago
Efficient Tag Identification in Mobile RFID Systems
In this paper we consider how to efficiently identify tags on the moving conveyor. Considering conditions like the path loss and multi-path effect in realistic settings, we first p...
Lei Xie, Bo Sheng, Chiu Chiang Tan, Hao Han, Qun L...
ADHOC
2006
97views more  ADHOC 2006»
14 years 10 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
85
Voted
CN
2002
117views more  CN 2002»
14 years 10 months ago
Achieving differentiated services through multi-class probabilistic priority scheduling
Differentiated Services (DiffServ) is a promising architecture for the next generation Internet due to its scalable and flexible design. In DiffServ, scheduling disciplines play an...
Chen-Khong Tham, Qi Yao, Yuming Jiang
ETT
2002
89views Education» more  ETT 2002»
14 years 9 months ago
Delay analysis of a probabilistic priority discipline
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko
TMC
2010
130views more  TMC 2010»
14 years 8 months ago
Efficient Coverage Maintenance Based on Probabilistic Distributed Detection
—Many wireless sensor networks require sufficient sensing coverage over long periods of time. To conserve energy, a coverage maintenance protocol achieves desired coverage by act...
Guoliang Xing, Xiangmao Chang, Chenyang Lu, Jianpi...