We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, r...
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Bayesian KnowledgeBases (BKB)are a rule-based probabilistic modelthat extend BayesNetworks(BN), by allowing context-sensitive independenceand cycles in the directed graph. BKBshav...
Abstract: In any r-uniform hypergraph H for 2 t r we define an runiform t-tight Berge-cycle of length , denoted by C(r,t) , as a sequence of distinct vertices v1, v2, . . . , v ,...