540 search results - page 7 / 108 » Competitive Routing over Time |
JSAC
2008
13 years 9 months ago
2008
Abstract-- This paper considers the integration of communication and control with respect to the task of coordinated heading control for a group of N vehicles. The heading control ...
IPL
2008
13 years 9 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
SIGMETRICS
2008
ACM
13 years 9 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
We consider the online problem of non-preemptive queue management. An online sequence of packets arrive, each of which has an associated intrinsic value. Packets can be accepted t...