Sciweavers

1494 search results - page 276 / 299
» Polynomial time algorithms for network information flow
Sort
View
LATIN
2010
Springer
13 years 7 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
IWCMC
2009
ACM
14 years 3 months ago
Effect of feedback prediction on OFDMA system throughput
In wireless communication systems, adaptive modulation and coding (AMC) is used to improve the downlink (DL) spectral efficiency by exploiting the underlying channel condition. Ho...
Mohammad Abdul Awal, Lila Boukhatem
CONEXT
2005
ACM
13 years 10 months ago
Location based placement of whole distributed systems
The high bandwidth and low latency of the modern internet has made possible the deployment of distributed computing platforms. The XenoServer platform provides a distributed compu...
David Spence, Jon Crowcroft, Steven Hand, Timothy ...
ICML
1999
IEEE
14 years 9 months ago
Distributed Value Functions
Many interesting problems, such as power grids, network switches, and tra c ow, that are candidates for solving with reinforcement learningRL, alsohave properties that make distri...
Jeff G. Schneider, Weng-Keen Wong, Andrew W. Moore...
WWW
2008
ACM
14 years 9 months ago
Anycast CDNS revisited
Because it is an integral part of the Internet routing apparatus, and because it allows multiple instances of the same service to be "naturally" discovered, IP Anycast h...
Hussein A. Alzoubi, Seungjoon Lee, Michael Rabinov...