Sciweavers

334 search results - page 53 / 67
» Approximation Algorithms for Non-Uniform Buy-at-Bulk Network...
Sort
View
ICRA
2006
IEEE
217views Robotics» more  ICRA 2006»
14 years 2 months ago
Complete Coverage Control for Nonholonomic Mobile Robots in Dynamic Environments
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
Yi Guo, Mohanakrishnan Balakrishnan
FSTTCS
2010
Springer
13 years 6 months ago
Minimizing Busy Time in Multiple Machine Real-time Scheduling
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, ...
FOCS
1995
IEEE
14 years 4 days ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
MM
2009
ACM
160views Multimedia» more  MM 2009»
14 years 3 months ago
On statistical multiplexing of variable-bit-rate video streams in mobile systems
We consider the problem of broadcasting multiple variable-bit-rate (VBR) video streams from a base station to many mobile devices over a wireless network, so that: (i) perceived q...
Cheng-Hsin Hsu, Mohamed Hefeeda
MOBIHOC
2008
ACM
14 years 8 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...