—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
S. M. Kamrul Hasan, Ruhul A. Sarker, David Cornfor...
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
The commonly used task models for real-time systems focus on execution windows expressing earliest start times and deadlines of tasks for feasibility. Within these windows, execut...
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
Minos N. Garofalakis, Yannis E. Ioannidis, Banu &O...
DIET (Distributed Interactive Engineering Toolbox) is a toolbox for the construction of Network Enabled Server (NES) systems. For most NES systems, as for most grid middleware sys...