Sciweavers

473 search results - page 90 / 95
» Computing shortest paths with uncertainty
Sort
View
AINA
2005
IEEE
15 years 3 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko
SAC
2003
ACM
15 years 2 months ago
iGrocer- A Ubiquitous and Pervasive Smart Grocery Shopping System
Emerging Smart phones are poised to give a whole new dimension to the way we shop, bank, and go about many of our everyday activities. iGrocer is a smart grocery shopping assistant...
Sangeetha Shekar, Prashant Nair, Abdelsalam Helal
LCN
2000
IEEE
15 years 2 months ago
Tree-Based Reliable Multicast in Combined Fixed/Mobile IP Networks
This paper proposes a solution to delivering multicast data reliably not only to/from fixed hosts but also to/from mobile hosts in combined fixed/mobile IP networks, particularl...
Wonyong Yoon, Dongman Lee, Chansu Yu, Myungchul Ki...
WG
1998
Springer
15 years 1 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
99
Voted
PODC
1997
ACM
15 years 1 months ago
Dynamic Wavelength Allocation in Optical Networks
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
Ornan Ori Gerstel, Galen H. Sasaki, Shay Kutten, R...