14078 search results - page 2204 / 2816 » Design and Analysis of Computer Algorithms |
201
click to vote
DCOSS
2011
Springer
14 years 6 months ago
2011
Springer
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
226
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
188
click to vote
SPAA
2006
ACM
16 years 1 months ago
2006
ACM
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
198
click to vote
SIGECOM
2010
ACM
15 years 12 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
236
click to vote
ICPP
1993
IEEE
15 years 11 months ago
1993
IEEE
Scalability of parallel architectures is an interesting area of current research. Shared memory parallel programming is attractive stemming from its relative ease in transitioning...