Markov Decision Process Tayloring for Approximation Design Optimal control problems are difficult to solve on large state spaces, calling the development of approximate solution methods. In “A Low-rank MDPs via Moment Coupling,” Zhang and Gurvich introduce a novel framework decision processes (MDPs) that stands two pillars: (i) aggregation, as algorithmic infrastructure, (ii) central-limit-theo...

Assume that the edges of a complete bipartite graph K(A,B) are colored with r colors. In this paper we study coverings of B by vertex disjoint monochromatic cycles, connected matchings, and connected subgraphs. These problems occur in several applications.

In [1], we proposed AC-discrimination nets to speed up many-to-one AC-matching. We also proposed secondary automata as a novel data structure to further improve the performance of ACmatching on problems typically arising in practice. In this paper, we present the implementation of AC-discrimination nets within an equational theorem proving system. The implementation exploits the fact that altho...

A graph G is a (d, d + 1)-graph if the degree of each vertex of G is either d or d + 1. If d ≥ 2 is an integer and G a (d, d + 1)-graph with exactly one odd component and with no almost perfect matching, then we show in this paper that |V (G)| ≥ 4(d + 1) + 1 and |V (G)| ≥ 4(d + 1) + 3 when d is odd. This result generalizes corresponding statements by C. Zhao (J. Combin. Math. Combin. Comput. 9 ...

to demonstrate more visibly the close relation between thecontinuity and integrability, a new proof for the banach-zareckitheorem is presented on the basis of the radon-nikodym theoremwhich emphasizes on measure-type properties of the lebesgueintegral. the banach-zarecki theorem says that a real-valuedfunction $f$ is absolutely continuous on a finite closed intervalif and only if it is continuo...

Let f(n, r, k) be the minimal number such that every hypergraph larger than f(n, r, k) contained in ([n] r ) contains a matching of size k, and let g(n, r, k) be the minimal number such that every hypergraph larger than g(n, r, k) contained in the r-partite r-graph [n]r contains a matching of size k. The Erdős-Ko-Rado theorem states that f(n, r, 2) = (n−1 r−1 ) (r ≤ n 2 ) and it is easy to show...