832 search results - page 109 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
154
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
161
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which...
140
click to vote
ISPDC
2007
IEEE
16 years 17 days ago
2007
IEEE
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
178
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
176
click to vote
TALG
2008
15 years 6 months ago
2008
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...