In this paper, we consider the joint problem of congestion control and scheduling with multi-class Quality of Service (QoS) requirements. Generally, the joint problem is formulated...
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
—We propose a distributed scheduling and active queue management mechanism for wireless ad hoc networks. The approach is based on a random access scheduler where the transmission...
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...