1414 search results - page 283 / 283 » Performance Bounds in Communication Networks with Variable-R... |
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— We consider the lossy transmission of source information over Rayleigh fading channels. We investigate the utility of two channel capacity definitions, ergodic capacit...
PCRCW
1997
Springer
13 years 11 months ago
1997
Springer
In recent years, theChaos Project at theUniversityofWashingtonhas analyzed and simulated a dozen routing algorithms. Three new routing algorithms have been invented; of these, the...
TWC
2008
13 years 7 months ago
2008
Reliable channel state information at the transmitter (CSIT) can improve the throughput of wireless networks significantly. In a realistic scenario, there is a mismatch between th...
CCO
2001
Springer
14 years 6 hour ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...