3910 search results - page 373 / 782 » Analyzing Cross-Connected Networks |
132
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
—E-limited (or K-limited) scheduling is attractive because its performance is close to that of the exhaustive scheduling which is proven to be the optimal polling scheme for symm...
174
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
—In this paper, we analyze the impact of imperfect channel quality feedback on the scheduling algorithms that exploit multi-user diversity. We consider a time-slotted MIMO broadc...
164
click to vote
ICCCN
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...
160
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— This work investigates three aspects: (a) a network vulnerability as the non-uniform vulnerable-host distribution, (b) threats, i.e., intelligent worms that exploit such a vuln...
210
click to vote
AAMAS
2007
Springer
16 years 29 days ago
2007
Springer
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that...