Pages that link to "Item:Q1879362"
From MaRDI portal
The following pages link to Online scheduling with partial job values: does timesharing or randomization help? (Q1879362):
Displayed 14 items.
- 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)
- Preemptive scheduling in overloaded systems. (Q1401985) (← links)
- Improved competitive algorithms for online scheduling with partial job values (Q1884846) (← links)
- Collecting weighted items from a dynamic queue (Q1939667) (← links)
- Online competitive algorithms for maximizing weighted throughput of unit jobs (Q2458928) (← links)
- Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints (Q3004685) (← links)
- Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs (Q3007646) (← links)
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs (Q3602829) (← links)
- Randomized Algorithms for Buffer Management with 2-Bounded Delay (Q3602832) (← links)
- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers (Q3638455) (← links)
- Prompt Mechanisms for Online Auctions (Q5459982) (← links)
- ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO (Q5462125) (← links)