Dynamic spectrum allocation: the impotency of duration notification.

DOI10.1002/1099-1425(200009/10)3:5%3C289::AID-JOS49%3E3.0.CO;2-PzbMATH Open1153.90426MaRDI QIDQ1588057FDOQ1588057

Authors: Bala Kalyanasundaram, Kirk Pruhs 

Publication date: 27 July 2003

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

Recommendations

• scientific article; zbMATH DE number 2080221
• Dynamic storage allocation with known durations
• Dynamic storage allocation with known durations
• scientific article; zbMATH DE number 1003306
• Tight Bounds for Dynamic Storage Allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Tight Bounds for Dynamic Storage Allocation
• Title not available (Why is that?)
• An Introduction to Combinatorial Models of Dynamic Storage Allocation
• The Bay Restaurant--A Linear Storage Problem
• An Estimate of the Store Size Necessary for Dynamic Storage Allocation
• Bounds for Some Functions Concerning Dynamic Storage Allocation
• A dynamic storage allocation problem

Cited In (3)

• Title not available (Why is that?)
• Dynamic storage allocation with known durations
• A performance analysis of channel fragmentation in dynamic spectrum access systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1588057)