1207 search results - page 12 / 242 » On distributed optimization using generalized gossip |
159
click to vote
MSR
2009
ACM
15 years 8 months ago
2009
ACM
Researchers continue to demonstrate the benefits of Mining Software Repositories (MSR) for supporting software development and research activities. However, as the mining process...
129
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
104
Voted
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...
127
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
119
Voted
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
Relying on optimally distinguishable distributions (ODD), it was defined very recently a new framework for the composite hypothesis testing. We resort to the linear model to inve...