8810 search results - page 1327 / 1762 » Openness |
145
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
How to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decod...
168
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
166
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the model of population protocols introduced by Angluin et al. [AAD+ 04], in which anonymous finite-state agents stably compute a predicate of the multiset of their in...
183
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
197
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the sample size), a...