We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes M.Z. Kwiatkowska and G.J. Norman School of Computer Science, University of Birmingham, Edgbaston, ...
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
A Data Warehouse DW is a database that collects and stores data from multiple remote and heterogeneous information sources. When a query is posed, it is evaluated locally, without...
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...