Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
The problem of statically assigning nonpartitioned files in a parallel I/O system has been extensively investigated. A basic workload characteristic assumption of existing solutio...
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the tra...
Classifying what-type questions into proper semantic categories is found more challenging than classifying other types in question answering systems. In this paper, we propose to ...
The paradigm of “human computation” seeks to harness human abilities to solve computational problems or otherwise perform distributed work that is beyond the scope of current ...