Sciweavers

625 search results - page 2 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
TWC
2010
13 years 4 months ago
Optimized opportunistic multicast scheduling (OMS) over wireless cellular networks
Optimized opportunistic multicast scheduling (OMS) is studied for cellular networks, where the problem of efficiently transmitting a common set of fountain-encoded data from a sin...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...
TON
2012
12 years 6 days ago
Opportunistic Flow-Level Latency Estimation Using Consistent NetFlow
—The inherent measurement support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problem...
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
EOR
2006
90views more  EOR 2006»
13 years 9 months ago
A parallelizable dynamic fleet management model with random travel times
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...
Huseyin Topaloglu
HIS
2008
13 years 11 months ago
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given ...
Bin Hu, Günther R. Raidl
IEAAIE
1994
Springer
14 years 1 months ago
Applying Blackboard Techniques to Real-Time Signal Processing and Multimedia Network Management
Two recent projects at ORA have used a blackboard framework during system design.1 DANA is a multimedia network monitoring system, while MARRS is a real-time passive radar system....
Randall J. Calistri-Yeh