The following pages link to (Q4473894):
Displayed 6 items.
- Reducing network and computation complexities in neural based real-time scheduling scheme (Q632870) (← links)
- On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough (Q849297) (← links)
- Round robin scheduling of heterogeneous parallel servers in heavy traffic (Q2378336) (← links)
- Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates (Q2494558) (← links)
- Multi-layered round robin routing for parallel servers (Q2505098) (← links)
- Minimization of the total completion time for asynchronous transmission in a packet data-transmission system (Q3587069) (← links)