121 search results - page 8 / 25 » An Efficient Parallel Algorithm for Solving the Knapsack Pro... |
PC
2002
13 years 8 months ago
2002
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
PODC
2010
ACM
13 years 10 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
SPAA
1990
ACM
14 years 14 days ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
APDC
1997
13 years 9 months ago
1997
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...
ISPAN
2002
IEEE
14 years 1 months ago
2002
IEEE
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...