625 search results - page 56 / 125 » Approximating Travel Times Using Opportunistic Networking |
126
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
132
Voted
PODC
2006
ACM
15 years 9 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
120
Voted
WSC
2001
15 years 4 months ago
2001
Large-scale military deployments require transporting equipment and personnel over long distances in a short time. Planning an efficient airlift system is complicated and several ...
140
Voted
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Fault tolerance techniques have been widely used in wireless sensor networks. Base station placement to maximize the network lifetime has also been well studied. However, limite...
133
Voted
WSC
1998
15 years 4 months ago
1998
A regional transportation system and the movement of large traffic volumes through it, are characteristic of stochastic systems. The standard traffic management or transportation ...