143 search results - page 12 / 29 » Time-shift scheduling - fair scheduling of flows in high-spe... |
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—The paper addresses the maximal lifetime problem in sensor-target surveillance networks. Given a set of sensors and targets in an Euclidean plane, each sensor can watch all targ...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
—The Internet has witnessed a rapid growth in deployment of data-driven overlay network (DON) based streaming applications during recent years. In these applications, each nodes ...
ORL
1998
13 years 7 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
AAAI
2010
13 years 9 months ago
2010
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
TWC
2008
13 years 7 months ago
2008
Abstract--In this paper, the flow-level performance of opportunistic scheduling in orthogonal frequency division multiplexing (OFDM) networks is studied. The analysis accounts for ...