Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
In this note we present and discuss results of experiments comparing the performance of six neural network architectures (back propagation, recurrent network with dampened feedbac...
Marcin Paprzycki, Rick Niess, Jason Thomas, Lenny ...
Abstract. Prohibiting configurations (≡ induced finite connected posets) in Priestley spaces and properties of the associated classes of distributive lattices, and the related ...
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...