We present some theoretical results related to the problem
of actively searching for a target in a 3D environment,
under the constraint of a maximum search time. We define
the o...
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
Ganesh Ramesh, William Maniatty, Mohammed Javeed Z...
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
We propose a model for modular synchronous systems with combinational dependencies and define consistency using this model. We then show how to derive this model from a modular spe...
Randal E. Bryant, Pankaj Chauhan, Edmund M. Clarke...
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...