2924 search results - page 274 / 585 » Lower Bounds in Distributed Computing |
108
click to vote
OPODIS
2004
15 years 5 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
110
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
132
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
143
click to vote
TCS
2008
15 years 4 months ago
2008
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
166
click to vote
TWC
2008
15 years 4 months ago
2008
In a wireless multiple-input multiple-output (MIMO) system, transmit antenna selection is an effective means of achieving good performance with low complexity. We consider spatial ...