Searching for "Scheduling Malleable Parallel Tasks An Asymptotic Fully Polynomial Time Approximation Scheme." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
by Klaus Jansen — 2004 — Algorithmica
…Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme…
Cited by 7 (2 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB