The following pages link to (Q4230343):
Displaying 16 items.
- An improved lower bound for load balancing of tasks with unknown duration (Q287100) (← links)
- Fair resource allocation for different scenarios of demands (Q439500) (← links)
- On large deviations in load sharing networks (Q1296617) (← links)
- New algorithms for related machines with temporary jobs. (Q1588054) (← 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)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- Anonymity and k-Choice Identities (Q3600341) (← links)
- On-line resource management with applications to routing and scheduling (Q4645187) (← links)
- Stochastic analysis of dynamic processes (Q5055922) (← links)
- Online perfect matching and mobile computing (Q5057433) (← links)
- Online load balancing of temporary tasks (Q5060106) (← links)
- On-line load balancing for related machines (Q5096930) (← 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)
