Indexed metadata

A strategy proof mechanism for scheduling divisible loads in bus networks without control processors

T.E. Carroll, D. Grosu

Source record

Source: Crossref

Published: Jan 1, 2006

DOI: 10.1109/ipdps.2006.1639263

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A strategy proof mechanism for scheduling divisible loads in bus networks without control processors — Mathematical Frontier Network