In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
Whereas the selection concept of Genetic Algorithms (GAs) and Genetic Programming (GP) is basically realized by the selection of above-average parents for reproduction, Evolution S...
Michael Affenzeller, Stefan Wagner 0002, Stephan M...
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound an...
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan