Sciweavers

530 search results - page 80 / 106
» Bounds on marginal probability distributions
Sort
View
TWC
2011
367views more  TWC 2011»
13 years 3 months ago
Improving the Performance of Wireless Ad Hoc Networks Through MAC Layer Design
—In this paper, the performance of the ALOHA and CSMA MAC protocols are analyzed in spatially distributed wireless networks. The main system objective is correct reception of pac...
Mariam Kaynia, Nihar Jindal, Geir E. Øien
AMAI
2004
Springer
14 years 1 months ago
Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
Dmitri A. Dolgov, Edmund H. Durfee
IPSN
2004
Springer
14 years 1 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
TKDE
2010
184views more  TKDE 2010»
13 years 6 months ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
ATAL
2009
Springer
14 years 2 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus