Pages that link to "Item:Q3125220"
From MaRDI portal
The following pages link to On-Line Load Balancing of Temporary Tasks (Q3125220):
Displayed 16 items.
- Minimizing maximum (weighted) flow-time on related and unrelated machines (Q513278) (← links)
- On-line load balancing made simple: greedy strikes back (Q924556) (← links)
- On-line algorithms for the channel assignment problem in cellular networks. (Q1427805) (← links)
- New algorithms for related machines with temporary jobs. (Q1588054) (← links)
- Exponential penalty function control of loss networks (Q1769408) (← links)
- On-line restricted assignment of temporary tasks with unknown durations. (Q1853182) (← links)
- Local base station assignment with time intervals in mobile computing environments (Q1877045) (← links)
- A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations (Q2345465) (← links)
- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations (Q2868635) (← links)
- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem (Q3508564) (← links)
- (Q5111740) (← links)
- Minimum Congestion Mapping in a Cloud (Q5258917) (← links)
- Dynamic storage allocation with known durations (Q5918029) (← links)
- Competitive routing of virtual circuits with unknown duration (Q5943097) (← links)
- On-line load balancing of temporary tasks revisited (Q5958311) (← links)
- On-line bin-stretching (Q5958712) (← links)