A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
This paper introduces Lazy Transitions Systems (LzTSs). The notion of laziness explicitly distinguishes between the enabling and the firing of an event in a transition system. LzT...
Jordi Cortadella, Michael Kishinevsky, Alex Kondra...
We propose a novel approach for modelling correlations
between activities in a busy public space captured by multiple
non-overlapping and uncalibrated cameras. In our approach,
...
Chen Change Loy (Queen Mary, University of London)...