625 search results - page 6 / 125 » Approximating Travel Times Using Opportunistic Networking |
84
Voted
MSS
2003
IEEE
15 years 2 months ago
2003
IEEE
Disk drives are now available with capacities on the order of hundreds of gigabytes. What has not become available is an easy way to manage storage. With installed machines locate...
HIPC
2009
Springer
14 years 7 months ago
2009
Springer
We investigate the problem of scheduling in OFDMbased multihop relay networks with special emphasis on IEEE 802.16j based WiMAX networks. In such networks, scheduling is the probl...
104
click to vote
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
CSC
2009
14 years 10 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—The inherent support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problems where the ...