Pages that link to "Item:Q1879362"

The following pages link to Online scheduling with partial job values: does timesharing or randomization help? (Q1879362):

Displaying 29 items.

• Adaptive online scheduling of tasks with anytime property on heterogeneous resources (Q342556) (← links)
• A comprehensive study of an online packet scheduling algorithm (Q391217) (← 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)
• Preemptive scheduling in overloaded systems. (Q1401985) (← links)
• Comparison-based buffer management in QoS switches (Q1742380) (← links)
• Improved competitive algorithms for online scheduling with partial job values (Q1884846) (← links)
• Collecting weighted items from a dynamic queue (Q1939667) (← links)
• A universal randomized packet scheduling algorithm (Q2017873) (← links)
• Improved randomized online scheduling of intervals and jobs (Q2254495) (← links)
• Prompt mechanism for online auctions with multi-unit demands (Q2355988) (← links)
• Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints (Q2392745) (← links)
• Non-preemptive buffer management for latency sensitive packets (Q2400042) (← links)
• Online packet scheduling with bounded delay and lookahead (Q2419122) (← links)
• Online competitive algorithms for maximizing weighted throughput of unit jobs (Q2458928) (← links)
• Randomized two-valued bounded delay online buffer management (Q2661627) (← links)
• The loss of serving in the dark (Q2680226) (← links)
• Prompt Mechanism for Online Auctions with Multi-unit Demands (Q2867113) (← 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)
• A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines (Q5048294) (← links)
• Prompt Mechanisms for Online Auctions (Q5459982) (← links)
• ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO (Q5462125) (← links)
• An optimal algorithm for 2-bounded delay buffer management with lookahead (Q5925532) (← links)