284 search results - page 45 / 57 » Distributed Agreement with Optimal Communication Complexity |
178
click to vote
SAC
2000
ACM
15 years 7 months ago
2000
ACM
The global scenario put together by communication networks determines new opportunities towards the realization of Internetbased distributed services in many complex and composite...
139
Voted
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In modern wireless networks the functions included into layer II have to deal with complex problems, such as security and access control, that were previously demanded to upper...
100
Voted
MOBIHOC
2009
ACM
16 years 4 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
137
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...
139
Voted
MA
2010
Springer
15 years 1 months ago
2010
Springer
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...