We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
Daniel S. Bernstein, Shlomo Zilberstein, Neil Imme...
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
A. Abouelaoualim, V. Borozan, Yannis Manoussakis, ...
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but...
Abstract-- Linear transmit beamforming and receive combining is a low complexity approach for communications in the multiuser multiple-input multiple-output (MIMO) channel. This pa...
Chan-Byoung Chae, David Mazzarese, Takao Inoue, Ro...
Security analysis of learning algorithms is gaining increasing importance, especially since they have become target of deliberate obstruction in certain applications. Some securit...