3638 search results - page 719 / 728 » Optimization via communication networks |
PODC
2005
ACM
14 years 1 months ago
2005
ACM
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
CCO
2001
Springer
14 years 14 days 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...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Many applications in multiagent learning are essentially convex optimization problems in which agents have only limited communication and partial information about the function be...
JSAC
2008
13 years 8 months ago
2008
Code-division multiple access (CDMA) is the basis of a family of advanced air interfaces in current and future generation networks. The benefits promised by CDMA have not been full...
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...