Abstract. We present a parallel job scheduling approach for coarsegrain timesharing which preempts jobs to disk and avoids any additional memory pressure. The approach provides con...
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
T. C. Hu, Lawrence L. Larmore, J. David Morgenthal...
Abstract. The Unification-based Temporal Grammar is a temporal extension of static unification-based grammars. It defines a hierarchical temporal rule language to express comple...
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
Krzysztof Giaro, Marek Kubale, Michal Malafiejski,...
Abstract. We present a new combination CSP-OZ-DC of three well researched formal techniques for the specification of processes, data and time: CSP [17], Object-Z [36], and Duration...