1207 search results - page 105 / 242 » On distributed optimization using generalized gossip |
138
Voted
SIGCOMM
2005
ACM
15 years 9 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
139
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
121
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
125
Voted
HPCA
2000
IEEE
15 years 8 months ago
2000
IEEE
Clustered microarchitectures are an effective approach to reducing the penalties caused by wire delays inside a chip. Current superscalar processors have in fact a two-cluster mic...
127
Voted
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...