In this paper, we investigate cyclic sequences which contain as elements all k-subsets of {0, 1, . . . , n-1} exactly once such that the unions of any two consecutive k-subsets of...
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Abstract-- A kind of complex dynamical networks with timevarying coupling delays is proposed. By some transformation, the synchronization problem of the complex networks is transfe...
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...