2924 search results - page 560 / 585 » Lower Bounds in Distributed Computing |
135
click to vote
DCOSS
2011
Springer
14 years 3 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 ...
146
Voted
PARA
1995
Springer
15 years 6 months ago
1995
Springer
Abstract. ScaLAPACK is a library of high performance linear algebra routines for distributed memory MIMD computers. It is a continuation of the LAPACK project, which designed and p...
121
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
149
click to vote
ICCAD
2006
IEEE
16 years 3 days ago
2006
IEEE
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
179
click to vote
MOBILITY
2009
ACM
15 years 9 months ago
2009
ACM
MANETs are self-organizing networks composed of mobile wireless nodes with often scarce resources. Distributed applications based on the P2P paradigm are by nature good candidates...