Pages that link to "Item:Q4285627"

The following pages link to Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling (Q4285627):

Displayed 5 items.

• A model for minimizing active processor time (Q487001) ‎ (← links)
• Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808) ‎ (← links)
• Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan (Q2338217) ‎ (← links)
• The maximum gain of increasing the number of preemptions in multiprocessor scheduling (Q2390934) ‎ (← links)
• The n-dimensional Stern–Brocot tree (Q5223031) ‎ (← links)