Models for video-on-demand scheduling with costs (Q286685): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Online bin packing with delay and holding costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for on-line bin-packing problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Bin Packing with Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3988808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound 2.5545 on 2D Online Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Around Near-Optimal Solutions for the Online Bin Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple on-line bin-packing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for multidimensional packing / rank
 
Normal rank

Revision as of 00:59, 12 July 2024

scientific article
Language Label Description Also known as
English
Models for video-on-demand scheduling with costs
scientific article

    Statements

    Identifiers