Sciweavers

1510 search results - page 63 / 302
» Upper Probabilities and Additivity
Sort
View
GLOBECOM
2008
IEEE
15 years 4 months ago
Time Dependent Message Spraying for Routing in Intermittently Connected Networks
—Intermittently connected mobile networks, also called Delay Tolerant Networks (DTNs), are wireless networks in which at any given time instance, the probability of having a comp...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski
COCO
2004
Springer
156views Algorithms» more  COCO 2004»
15 years 3 months ago
Multiparty Quantum Coin Flipping
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: • We propose and motivate a definition for quantum broadcast. Our model of quantum ...
Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, He...
JCST
2008
102views more  JCST 2008»
14 years 9 months ago
Random and Periodic Sleep Schedules for Target Detection in Sensor Networks
Abstract--We study Random and Periodic sleep schedules from the point of view of delay in detecting the target. We consider sleep schedules in which a sensor in `inactive' mod...
Vaishali P. Sadaphal, Bijendra N. Jain
SCL
2008
76views more  SCL 2008»
14 years 9 months ago
Probabilistic output admissible set for systems with time-varying uncertainties
This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial ...
Takeshi Hatanaka, Kiyotsugu Takaba
TWC
2008
109views more  TWC 2008»
14 years 9 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad Hoc Networks
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...
Atef Abdrabou, Weihua Zhuang