—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Embedded systems for closed-loop applications often behave as discrete-time semi-Markov processes (DTSMPs). Performability measures most meaningful to iterative embedded systems, ...
—Stochastic activity networks (SANs) are a stochastic generalization of Petri nets. SAN models have been used to evaluate a wide range of systems and are supported by several mod...
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
—In this paper, we present a comprehensive analysis of self-dual and m-idempotent operators. We refer to an operator as m-idempotent if it converges after m iterations. We focus ...
Nidhal Bouaynaya, Mohammed Charif-Chefchaouni, Dan...