Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...