Normal view MARC view ISBD view

Lower Bound onNumber of Processors and Time for Scheduling Precedence Graphs Wirh Communication Costs

Al-Mouhamed, M

Lower Bound onNumber of Processors and Time for Scheduling Precedence Graphs Wirh Communication Costs - 1390-1401 p.

Subjects--Topical Terms:
Lower Bounds
Optimization
Paraliel Processing

Print
Request article
Suggest for purchase
Send to device
Save record
BIBTEX Dublin Core ISBD MARCXML RIS
More searches

Search for this title in:
Other Databases (Google Scholar) Open Library (openlibrary.org) Pakistan Union Catalogue (pastic.gov.pk) Other Libraries (WorldCat)