Abstract-- Some frequency-domain controller design problems are solved using a finite number of frequency samples. Consequently, the performance and stability conditions are not gu...
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
In this paper, we study domain decomposition preconditioners for multiscale flows in high contrast media. Our problems are motivated by porous media applications where low conduct...
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...