Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
Piotr Berman, Arnab Bhattacharyya, Elena Grigoresc...
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
A commonly used tool in disease association studies is the search for discrepancies between the haplotype distribution in the case and control populations. In order to find this d...
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...