We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
In conflict-free routing a set of agents have to traverse a common infrastructure without interfering with each other. Maza and Castagna [1] showed how route plans can be repaired ...
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
This work presents the first worst-case execution times (WCET) analysis of MPEG-decoding. Solutions for two scenarios (Video-on-Demand (VoD), live) are presented, serving as exam...
Peter Altenbernd, Lars-Olof Burchard, Friedhelm St...