706 search results - page 100 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
JACM
1998
13 years 8 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
ICRA
1999
IEEE
14 years 1 months ago
1999
IEEE
We consider the problem of automatically generating viewpoint motions for a virtual camera tracking a moving target. Given the target's trajectory, we plan the motion of a ca...
PERCOM
2006
ACM
14 years 8 months ago
2006
ACM
Consider a placement of heterogeneous, wireless sensors that can vary the transmission range by increasing or decreasing power. The problem of determining an optimal assignment of ...
ICFEM
2009
Springer
13 years 6 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
INFOCOM
2003
IEEE
14 years 2 months ago
2003
IEEE
—A methodology is presented for integrating effective-bandwidth-based routing for QoS-sensitive traffic and datagram routing of the best-effort traffic. To prevent excessive dela...