5183 search results - page 646 / 1037 » The Complexity of Distributions |
174
click to vote
IPPS
1994
IEEE
15 years 11 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
166
click to vote
IPPS
1994
IEEE
15 years 11 months ago
1994
IEEE
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
185
click to vote
ICS
1993
Tsinghua U.
15 years 11 months ago
1993
Tsinghua U.
Performance monitoring of large scale parallel computers creates a dilemma: we need to collect detailed information to find performance bottlenecks, yet collecting all this data ...
167
click to vote
ICS
1993
Tsinghua U.
15 years 11 months ago
1993
Tsinghua U.
—Data dependence analysis techniques are the main component of today’s strategies for automatic detection of parallelism. Parallelism detection strategies are being incorporate...
139
click to vote
IFIP
1994
Springer
15 years 11 months ago
1994
Springer
Development of a research project in Computer Science, integrating a considerable number of research institutions and about 1200 individual researchers all over a country with big...