Let be a triangle-free distance-regular graph with diameter d 3, valency k 3 and intersection number a2 = 0. Assume has an eigenvalue with multiplicity k. We show that if for ...
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
— We study stability regions of multi-rate Gaussian multiple access (MAC) and broadcast (BC) networks with centralized scheduling algorithms. Techniques are presented to characte...
The decentralized navigation function methodology, established in our previous work for navigation of multiple holonomic agents with global sensing capabilities is extended to the...
Abstract In this paper we address the problem of aggregating outranking statements from multiple preference criteria of ordinal significance. The concept of ordinal concordance of ...