17541 search results - page 215 / 3509 » Complexity in scalable computing |
114
click to vote
CONEXT
2010
ACM
15 years 1 months ago
2010
ACM
We introduce a protocol which routes on flat, locationindependent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of...
127
Voted
HIPC
2007
Springer
15 years 9 months ago
2007
Springer
As computational clusters increase in size, their mean-time-to-failure reduces. Typically checkpointing is used to minimize the loss of computation. Most checkpointing techniques, ...
140
Voted
SAC
2009
ACM
15 years 10 months ago
2009
ACM
The prediction of the correct secondary structures of large RNAs is one of the unsolved challenges of computational molecular biology. Among the major obstacles is the fact that a...
129
Voted
SC
2009
ACM
15 years 10 months ago
2009
ACM
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...
118
Voted
ALGORITHMICA
2006
15 years 3 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...