scientific article; zbMATH DE number 742966
From MaRDI portal
Publication:4763408
Recommendations
Cited in
(24)- On-line load balancing
- Optimal online algorithms for an electronic commerce money distribution system
- Online balanced repartitioning
- On-line restricted assignment of temporary tasks with unknown durations.
- Offline file assignments for online load balancing
- Online load balancing with general reassignment cost
- Worst-case analysis for on-line service policies
- Online scheduling of jobs with favorite machines
- Competitive strategies for an online generalized assignment problem with a service consecution constraint
- An improved lower bound for load balancing of tasks with unknown duration
- On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
- scientific article; zbMATH DE number 1347106 (Why is no real title available?)
- The Competitiveness of On-Line Assignments
- Simultaneously load balancing for every p-norm, with reassignments
- On-line resource management with applications to routing and scheduling
- Online Scheduling on a CPU-GPU Cluster
- Stochastic analysis of dynamic processes
- Online perfect matching and mobile computing
- Online load balancing of temporary tasks
- On-line load balancing for related machines
- Competitive routing of virtual circuits with unknown duration
- Load balancing for response time
- Improved bounds for on-line load balancing
- On-line maximum matching in complete multi-partite graphs with an application to optical networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763408)
