Preemptive Scheduling on Selfish Machines (Q5458506): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal preemptive scheduling for general target functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level Algorithm for Preemptive Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truth revelation in approximately efficient combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful approximation mechanisms for restricted combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan and preemption costs on a system of uniform machines / rank
 
Normal rank

Latest revision as of 21:22, 27 June 2024

scientific article; zbMATH DE number 5263884
Language Label Description Also known as
English
Preemptive Scheduling on Selfish Machines
scientific article; zbMATH DE number 5263884

    Statements