Sciweavers

4759 search results - page 318 / 952
» Parallelizing the Phylogeny Problem
Sort
View
IPPS
1994
IEEE
15 years 10 months ago
Efficient Matrix Chain Ordering in Polylog Time
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 ...
Phillip G. Bradford, Gregory J. E. Rawlins, Gregor...
ICPP
1992
IEEE
15 years 10 months ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç
EUROPAR
2007
Springer
16 years 26 days ago
A Framework for Scheduling with Online Availability
Abstract. With the increasing popularity of large-scale distributed computing networks, a new aspect has to be considered for scheduling problems: machines may not be available per...
Florian Diedrich, Ulrich M. Schwarz
PVM
2005
Springer
16 years 5 days ago
A Grid-Aware Branch, Cut and Price Implementation
Abstract. This paper presents a grid-enabled system for solving largescale optimization problems. The system has been developed using Globus and MPICH-G2 grid technologies, and con...
Emilio Mancini, Sonya Marcarelli, Pierluigi Ritrov...
EUROPAR
2003
Springer
15 years 12 months ago
The Verifying Compiler: A Grand Challenge for Computing Research
I propose a set of criteria which distinguish a grand challenge in science or engineering from the many other kinds of short-term or long-term research problems that engage the int...
C. A. R. Hoare