Pages that link to "Item:Q2458928"

The following pages link to Online competitive algorithms for maximizing weighted throughput of unit jobs (Q2458928):

Displaying 20 items.

• Competitive buffer management with packet dependencies (Q388119) (← links)
• A comprehensive study of an online packet scheduling algorithm (Q391217) (← links)
• Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) (← links)
• An optimal lower bound for buffer management in multi-queue switches (Q476433) (← links)
• Bounded delay packet scheduling in a bounded buffer (Q613334) (← links)
• Buffer management for colored packets with deadlines (Q693758) (← links)
• Randomized competitive algorithms for online buffer management in the adaptive adversary model (Q719250) (← links)
• Online buffer management for transmitting packets with processing cycles (Q1708032) (← links)
• Comparison-based buffer management in QoS switches (Q1742380) (← links)
• Collecting weighted items from a dynamic queue (Q1939667) (← links)
• A universal randomized packet scheduling algorithm (Q2017873) (← links)
• Online algorithms for the maximum \(k\)-interval coverage problem (Q2091105) (← links)
• Improved randomized online scheduling of intervals and jobs (Q2254495) (← links)
• Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints (Q2392745) (← links)
• Online packet scheduling with bounded delay and lookahead (Q2419122) (← links)
• Randomized two-valued bounded delay online buffer management (Q2661627) (← links)
• Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints (Q3004685) (← links)
• Improved Randomized Online Scheduling of Unit Length Intervals and Jobs (Q3602829) (← links)
• Randomized Algorithms for Buffer Management with 2-Bounded Delay (Q3602832) (← links)
• A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines (Q5048294) (← links)