Dynamic spectrum allocation: the impotency of duration notification.

DOI<link itemprop=identifier href="https://doi.org/10.1002/1099-1425(200009/10)3:5<289::AID-JOS49>3.0.CO;2-P" /><289::AID-JOS49>3.0.CO;2-P 10.1002/1099-1425(200009/10)3:5<289::AID-JOS49>3.0.CO;2-PzbMath1153.90426MaRDI QIDQ1588057

Kirk R. Pruhs, Bala Kalyanasundaram

Publication date: 27 July 2003

Published in: Journal of Scheduling (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic storage allocation problem
• An Introduction to Combinatorial Models of Dynamic Storage Allocation
• Bounds for Some Functions Concerning Dynamic Storage Allocation
• The Bay Restaurant--A Linear Storage Problem
• Tight Bounds for Dynamic Storage Allocation
• An Estimate of the Store Size Necessary for Dynamic Storage Allocation

This page was built for publication: Dynamic spectrum allocation: the impotency of duration notification.