1257 search results - page 199 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
DIALM
2008
ACM
14 years 11 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
BROADNETS
2004
IEEE
15 years 1 months ago
2004
IEEE
We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad hoc network. To reduce delays in the network, each user sends redundant packets along mu...
EWCBR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In both research fields, Case-Based Reasoning and Reinforcement Learning, the system under consideration gains its expertise from experience. Utilizing this fundamental c...
WICON
2008
14 years 11 months ago
2008
We present a fluid flow model to analyze backlog-based CSMA policies. The model is obtained using a CSMA fixed point approximation that has been recently proposed and analyzed. We...
117
click to vote
SPAA
2012
ACM
13 years 11 days ago
2012
ACM
GPU-based heterogeneous clusters continue to draw attention from vendors and HPC users due to their high energy efficiency and much improved single-node computational performance...