Sciweavers

632 search results - page 107 / 127
» On Routing in Circulant Graphs
Sort
View
JCSS
1998
51views more  JCSS 1998»
13 years 8 months ago
Randomized Query Processing in Robot Path Planning
d Abstract) LYDIA E. KAVRAKI   JEAN-CLAUDE LATOMBE   RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motw...
GLOBECOM
2009
IEEE
13 years 6 months ago
Joint Scheduling and Instantaneously Decodable Network Coding
We consider a wireless multi-hop network and design an algorithm for jointly optimal scheduling of packet transmissions and network coding. We consider network coding across differ...
Danail Traskov, Muriel Médard, Parastoo Sad...
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 4 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
INFOCOM
2008
IEEE
14 years 2 months ago
APL: Autonomous Passive Localization for Wireless Sensors Deployed in Road Networks
Abstract—In road networks, sensors are deployed sparsely (hundreds of meters apart) to save costs. This makes the existing localization solutions based on the ranging be ineffect...
Jaehoon Jeong, Shuo Guo, Tian He, David Du
INFOCOM
2008
IEEE
14 years 2 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang