You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format. However, this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the Department of Computer Science of the University of Maryland at College Park under terms that include this permission. All other rights are reserved by the author(s).
The periodic polytope and its applications to a scheduling problem - A. K. Subramani. A. Agrawala. May 2000. University of Maryland Institute for Advanced Computer Studies. Department of Computer Science, University of Maryland\.
The Parametric Polytope and its applications to a Scheduling Problem. K. Subrmani. A. Agrawala. March 2000. University of Maryland Institute for Advanced Computer Studies. Department of Computer Science, University of Maryland.
The Static Polytope and its applications to a scheduling problem. K. Subramani. A. Agrawala. March 2000. University of Maryland Institute for Advanced Computer Studies. Department of Computer Science, University of Maryland.
A Dual intepretation of Standard Constraints in Parametric Scheduling. K. Subramani. A. Agrawala. March 2000. University of Maryland Institute for Advanced Computer Studies. Department of Computer Science, University of Maryland.
Last Generated Fri Aug 11 04:01:01 EDT 2000