1207 search results - page 163 / 242 » On distributed optimization using generalized gossip |
115
Voted
FOCS
2008
IEEE
15 years 1 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
106
click to vote
CRYPTO
2005
Springer
15 years 6 months ago
2005
Springer
Motivated by the security of the nonlinear filter generator, the concept of correlation was previously extended to the conditional correlation, that studied the linear correlation...
112
Voted
MOBIHOC
2008
ACM
16 years 9 days ago
2008
ACM
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
89
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
102
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...