A large-scale multimedia server, in practice, has to service a large number of clients simultaneously. Given the real-time requirements of each client and the fixed data transfer ...
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
Willem Jan van Hoeve, Gilles Pesant, Louis-Martin ...
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
A parallel implementation of the specialized interior-point algorithm for multicommodity network flows introduced in [5] is presented. In this algorithm, the positive definite syst...
To specify a Bayes net (BN), a conditional probability table (CPT), often of an effect conditioned on its n causes, needs assessed for each node. Its complexity is generally expon...