Sciweavers

7133 search results - page 424 / 1427
» Communication algorithms with advice
Sort
View
MOBICOM
2003
ACM
16 years 3 days ago
Geographic routing without location information
For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e....
Ananth Rao, Christos H. Papadimitriou, Scott Shenk...
ICDCSW
2002
IEEE
15 years 11 months ago
Reducing the Cost of the Critical Path in Secure Multicast for Dynamic Groups
In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these ...
Sandeep S. Kulkarni, Bezawada Bruhadeshwar
DCOSS
2006
Springer
15 years 10 months ago
Gappa: Gossip Based Multi-channel Reprogramming for Sensor Networks
Abstract. Reprogramming the sensor networks in place is an important and challenging problem. One way suggested for reprogramming is with the help of an UAV (Unmanned Ariel Vehicle...
Limin Wang, Sandeep S. Kulkarni
AUTONOMICS
2008
ACM
15 years 8 months ago
Building multicast trees in ad-hoc networks
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
Raphaël Kummer, Peter G. Kropf, Pascal Felber
ACL
1998
15 years 8 months ago
Learning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for Email
This paper describes a novel method by which a dialogue agent can learn to choose an optimal dialogue strategy. While it is widely agreed that dialogue strategies should be formul...
Marilyn A. Walker, Jeanne Frommer, Shrikanth Naray...