Sciweavers

866 search results - page 151 / 174
» On Dynamic Shortest Paths Problems
Sort
View
COMPGEOM
2008
ACM
13 years 11 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
AMCS
2010
146views Mathematics» more  AMCS 2010»
13 years 9 months ago
Sensor network design for the estimation of spatially distributed processes
satisfactory network connectivity have dominated this line of research and abstracted away from the mathematical description of the physical processes underlying the observed pheno...
Dariusz Ucinski, Maciej Patan
TMC
2008
136views more  TMC 2008»
13 years 9 months ago
Efficient Resource Allocation for Wireless Multicast
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...
De-Nian Yang, Ming-Syan Chen
INFOCOM
2006
IEEE
14 years 3 months ago
Integrated Intermediate Waveband and Wavelength Switching for Optical WDM Mesh Networks
— As wavelength-division multiplexing (WDM) evolves towards practical applications in optical transport networks, waveband switching (WBS) has been introduced to cut down the ope...
Mengke Li, Byrav Ramamurthy
DSN
2005
IEEE
14 years 3 months ago
On Partial Protection in Groomed Optical WDM Mesh Networks
In this paper, we consider the problem of survivable network design in traffic groomed optical WDM mesh networks with sub-wavelength capacity connections. In typical survivable n...
Jing Fang, Mahesh Sivakumar, Arun K. Somani, Krish...