The following pages link to (Q5168850):
Displaying 20 items.
- Queueing with redundant requests: exact analysis (Q335898) (← links)
- The mean-field computation in a supermarket model with server multiple vacations (Q481355) (← links)
- Queuing with future information (Q744387) (← links)
- Design heuristic for parallel many server systems (Q1991286) (← links)
- Randomized longest-queue-first scheduling for large-scale buffered systems (Q2786425) (← links)
- Necessity of Future Information in Admission Control (Q2795878) (← links)
- Mean-Field Limits Beyond Ordinary Differential Equations (Q2822663) (← links)
- Power-of-<i>d</i>-Choices with Memory: Fluid Limit and Optimality (Q3387905) (← links)
- Reinforcement with Fading Memories (Q3387923) (← links)
- Asymptotically Maximal Throughput in Tandem Systems with Flexible and Dedicated Servers (Q4689399) (← links)
- On the Capacity of Information Processing Systems (Q4969342) (← links)
- On the Optimal Design of a Bipartite Matching Queueing System (Q5031017) (← links)
- Simple analytical solutions for the , , and related queues (Q5049900) (← links)
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances (Q5094912) (← links)
- Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems (Q5113878) (← links)
- On the Approximation Error of Mean-Field Models (Q5113881) (← links)
- Information and Memory in Dynamic Resource Allocation (Q5144790) (← links)
- The Supermarket Game (Q5168871) (← links)
- Utilizing partial flexibility to improve emergency department flow: Theory and implementation (Q6078597) (← links)
- Managing flexibility: optimal sizing and scheduling of flexible servers (Q6669141) (← links)
