242 search results - page 26 / 49 » Distributed algorithms with dynamical random transitions |
117
Voted
SODA
2010
ACM
16 years 5 hour ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
112
Voted
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in...
237
Voted
ICDCS
2012
IEEE
13 years 5 months ago
2012
IEEE
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
117
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
— The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC co...
136
click to vote
MTA
2006
15 years 2 months ago
2006
Given its readily deployable nature and broad applications for digital entertainment, video streaming through overlay networks has received much attention recently. While a tree to...