Abstract— Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditional...
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
Kevin Fan, Manjunath Kudlur, Hyunchul Park, Scott ...
—This paper considers the problem of pricing and transmission scheduling for an Access Point (AP) in a wireless network, where the AP provides service to a set of mobile users. T...
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Many scheduling problems are posed as optimization problems where the goal is to find a feasible schedule that maximizes the utilization of some resource. In some domains it is al...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...