3838 search results - page 311 / 768 » Techniques for Optimization of Net Algorithms |
192
click to vote
SPAA
1994
ACM
15 years 10 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
173
click to vote
DSN
2009
IEEE
15 years 10 months ago
2009
IEEE
In large storage systems, it is crucial to protect data from loss due to failures. Erasure codes lay the foundation of this protection, enabling systems to reconstruct lost data w...
168
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Cluster analysis is an integral part of high dimensional data analysis. In the context of large scale gene expression data, a filtered set of genes are grouped togethe...
201
click to vote
IPCO
2001
15 years 7 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
169
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...