The following pages link to (Q2921743):
Displayed 16 items.
- A comprehensive study of an online packet scheduling algorithm (Q391217) (← links)
- An optimal lower bound for buffer management in multi-queue switches (Q476433) (← 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)
- Scheduling packets with values and deadlines in size-bounded buffers (Q1944386) (← links)
- A universal randomized packet scheduling algorithm (Q2017873) (← links)
- Improved randomized online scheduling of intervals and jobs (Q2254495) (← links)
- Online packet scheduling with bounded delay and lookahead (Q2419122) (← links)
- The loss of serving in the dark (Q2680226) (← links)
- Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time (Q3599083) (← links)
- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers (Q3638455) (← links)
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines (Q5048294) (← links)
- An optimal algorithm for 2-bounded delay buffer management with lookahead (Q5925532) (← links)